乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:16:43Z","timestamp":1725974203785},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:00:00Z","timestamp":1686268800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2023,9]]},"abstract":"Abstract<\/jats:title>We extend a recent argument of Kahn, Narayanan and Park ((2021) Proceedings of the AMS<\/jats:italic> 149 3201\u20133208) about the threshold for the appearance of the square of a Hamilton cycle to other spanning structures. In particular, for any spanning graph, we give a sufficient condition under which we may determine its threshold. As an application, we find the threshold for a set of cyclically ordered copies of

\n$C_4$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> that span the entire vertex set, so that any two consecutive copies overlap in exactly one edge and all overlapping edges are disjoint. This answers a question of Frieze. We also determine the threshold for edge-overlapping spanning

\n$K_r$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula>-cycles.<\/jats:p>","DOI":"10.1017\/s0963548323000172","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T06:49:40Z","timestamp":1686293380000},"page":"833-850","update-policy":"http:\/\/dx.doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":2,"title":["Spanning -cycles in random graphs"],"prefix":"10.1017","volume":"32","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-5066-3820","authenticated-orcid":false,"given":"Alberto","family":"Espuny D\u00edaz","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-3091-3025","authenticated-orcid":false,"given":"Yury","family":"Person","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2023,6,9]]},"reference":[{"key":"S0963548323000172_ref16","first-page":"17","article-title":"Solution of a problem of P. Erd\u0151s and A. R\u00e9nyi on Hamiltonian cycles in undirected graphs","volume":"31","author":"Kor\u0161unov","year":"1977","journal-title":"Metody Diskretn. Anal."},{"key":"S0963548323000172_ref13","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20224"},{"key":"S0963548323000172_ref17","doi-asserted-by":"publisher","DOI":"10.1137\/120871729"},{"key":"S0963548323000172_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2019.106793"},{"key":"S0963548323000172_ref19","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20919"},{"key":"S0963548323000172_ref23","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399004150"},{"key":"S0963548323000172_ref15","doi-asserted-by":"publisher","DOI":"10.1090\/proc\/15419"},{"key":"S0963548323000172_ref8","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2021.194.2.2"},{"key":"S0963548323000172_ref24","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21111"},{"key":"S0963548323000172_ref3","unstructured":"[3] Bell, T. , Frieze, A. and Marbach, T. G. (2021) Rainbow thresholds. arXiv e-prints. arXiv:\u00a02104.05629."},{"key":"S0963548323000172_ref11","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21013"},{"key":"S0963548323000172_ref25","unstructured":"[25] Spiro, S. (2021) A smoother notion of spread hypergraphs. arXiv e-prints. arXiv:\u00a02106.11882."},{"key":"S0963548323000172_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01894879"},{"key":"S0963548323000172_ref9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20042"},{"key":"S0963548323000172_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/9781108332699.003"},{"key":"S0963548323000172_ref6","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erd\u0151s","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci. Ser. A"},{"key":"S0963548323000172_ref20","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20690"},{"key":"S0963548323000172_ref21","article-title":"A proof of the Kahn-Kalai conjecture,","author":"Park","year":"2022","journal-title":"Journal of the American Mathematical Society"},{"key":"S0963548323000172_ref2","unstructured":"[2] Bell, T. and Frieze, A. (2022) Rainbow powers of a Hamilton cycle in $G_{n,p}$ . arXiv e-prints. arXiv:\u00a02210.08534."},{"key":"S0963548323000172_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90068-6"},{"key":"S0963548323000172_ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384234"},{"key":"S0963548323000172_ref10","doi-asserted-by":"publisher","DOI":"10.3934\/math.2020309"},{"key":"S0963548323000172_ref12","volume-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","author":"Janson","year":"2000"},{"key":"S0963548323000172_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548307008474"},{"key":"S0963548323000172_ref26","unstructured":"[26] Talagrand, M. (2010) Are many small sets explicitly small? Association for Computing Machinery (ACM), New York, NY, pp. 13\u201336, Proceedings of the 42nd Annual ACM Symposium on Theory of Computing, STOC\u201910, June 5-8, 2010, Cambridge, MA, USA, ISBN 978-1-60558-817-9."},{"key":"S0963548323000172_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100058655"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548323000172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,8]],"date-time":"2023-08-08T12:49:47Z","timestamp":1691498987000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548323000172\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,9]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["S0963548323000172"],"URL":"https:\/\/doi.org\/10.1017\/s0963548323000172","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}