{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T04:54:27Z","timestamp":1776401667445,"version":"3.51.2"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T00:00:00Z","timestamp":1482364800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s00493-015-3228-2","type":"journal-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T06:20:16Z","timestamp":1482387616000},"page":"573-616","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Powers of Hamilton cycles in pseudorandom graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Peter","family":"Allen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julia","family":"B\u00f6ttcher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hi\u1ec7p","family":"H\u00e0n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiharu","family":"Kohayakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yury","family":"Person","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,22]]},"reference":[{"key":"3228_CR1","unstructured":"P. Allen, J. B\u00f6ttcher, H. H\u00e0n, Y. Kohayakawa and Y. Person: Blow-up lemmas for sparse graphs, in preparation."},{"key":"3228_CR2","doi-asserted-by":"crossref","unstructured":"P. Allen, J. B\u00f6ttcher, Y. Kohayakawa and Y. Person: Tight Hamilton cycles in random hypergraphs, Random Structures Algorithms, to appear (DOI: 10.1002\/rsa.20519).","DOI":"10.1002\/rsa.20519"},{"key":"3228_CR3","volume-title":"Electron. J. Combin.","author":"N. Alon","year":"1994","unstructured":"N. Alon: Explicit Ramsey graphs and orthonormal labelings, Electron. J. Combin. 1 (1994), Research Paper 12.","edition":"1"},{"key":"3228_CR4","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s00039-014-0270-y","volume":"24","author":"N. Alon","year":"2014","unstructured":"N. Alon and J. Bourgain: Additive patterns in multiplicative subgroups, Geom. Funct. Anal. 24 (2014), 721\u2013739.","journal-title":"Geom. Funct. Anal."},{"key":"3228_CR5","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/rsa.20143","volume":"31","author":"N. Alon","year":"2007","unstructured":"N. Alon and M. Capalbo: Sparse universal graphs for bounded-degree graphs, Random Structures Algorithms 31 (2007), 123\u2013133.","journal-title":"Random Structures Algorithms"},{"key":"3228_CR6","volume-title":"41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000)","author":"N. Alon","year":"2000","unstructured":"N. Alon, M. Capalbo, Y. Kohayakawa, V. R\u00f6dl, A. Ruci\u0144ski and E. Szemer\u00e9di: Universality and tolerance (extended abstract), in 41st Annual Symposium on Foundations of Computer Science (Redondo Beach, CA, 2000), 14\u201321. IEEE Comput. Soc. Press, Los Alamitos, CA, 2000."},{"key":"3228_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The probabilistic method","author":"N. Alon","year":"2008","unstructured":"N. Alon and J. H. Spencer: The probabilistic method, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Inc., Hoboken, NJ, third edition, 2008, With an appendix on the life and work of Paul Erd\u0151s.","edition":"third"},{"key":"3228_CR8","first-page":"35","volume-title":"Graph theory and combinatorics (Cambridge, 1983)","author":"B. Bollob\u00e1s","year":"1984","unstructured":"B. Bollob\u00e1s: The evolution of sparse graphs, in: Graph theory and combinatorics (Cambridge, 1983), 35\u201357. Academic Press, London, 1984."},{"key":"3228_CR9","volume-title":"An extension of the blow-up lemma to arrangeable graphs","author":"J. B\u00f6ttcher","year":"2013","unstructured":"J. B\u00f6ttcher, Y. Kohayakawa, A. Taraz and A. W\u00fcrfl: An extension of the blow-up lemma to arrangeable graphs, arXiv:1305.2059, 2013."},{"key":"3228_CR10","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s004930200010","volume":"22","author":"F. Chung","year":"2002","unstructured":"F. Chung and R. Graham: Sparse quasi-random graphs, Combinatorica 22 (2002), 217\u2013244.","journal-title":"Combinatorica"},{"key":"3228_CR11","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"F. R. K. Chung","year":"1989","unstructured":"F. R. K. Chung, R. L. Graham and R. M. Wilson: Quasi-random graphs, Combinatorica 9 (1989), 345\u2013362.","journal-title":"Combinatorica"},{"key":"3228_CR12","first-page":"101","volume":"27","author":"S. M. Cioab\u0103","year":"2005","unstructured":"S. M. Cioab\u0103: Perfect matchings, eigenvalues and expansion, C. R. Math. Acad. Sci. Soc. R. Can. 27 (2005), 101\u2013104.","journal-title":"C. R. Math. Acad. Sci. Soc. R. Can."},{"key":"3228_CR13","volume-title":"talk at RSA","author":"D. Conlon","year":"2013","unstructured":"D. Conlon: talk at RSA 2013."},{"key":"3228_CR14","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.aim.2013.12.004","volume":"256","author":"D. Conlon","year":"2014","unstructured":"D. Conlon, J. Fox and Y. Zhao: Extremal results in sparse pseudorandom graphs, Adv. Math. 256 (2014), 206\u2013290.","journal-title":"Adv. Math."},{"key":"3228_CR15","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1002\/jgt.3190130608","volume":"13","author":"C. Cooper","year":"1989","unstructured":"C. Cooper and A. M. Frieze: On the number of Hamilton cycles in a random graph, J. Graph Theory 13 (1989), 719\u2013735.","journal-title":"J. Graph Theory"},{"key":"3228_CR16","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/978-3-642-29344-3_20","volume-title":"LATIN 2012: Theoretical informatics (Arequipa, 2012)","author":"D. Dellamonica Jr.","year":"2012","unstructured":"D. Dellamonica Jr., Y. Kohayakawa, V. R\u00f6dl and A. Ruci\u0144ski: An improved upper bound on the density of universal random graphs, in: David Fern\u00e1ndez-Baca, editor, LATIN 2012: Theoretical informatics (Arequipa, 2012), 231\u2013242. Springer, 2012."},{"key":"3228_CR17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1137\/120884316","volume":"27","author":"R. Glebov","year":"2013","unstructured":"R. Glebov and M. Krivelevich: On the number of Hamilton cycles in sparse random graphs, SIAM J. Discrete Math. 27 (2013), 27\u201342.","journal-title":"SIAM J. Discrete Math."},{"key":"3228_CR18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1017\/S0963548300001012","volume":"3","author":"S. Janson","year":"1994","unstructured":"S. Janson: The numbers of spanning trees, Hamilton cycles and perfect matchings in a random graph, Combin. Probab. Comput. 3 (1994), 97\u2013126.","journal-title":"Combin. Probab. Comput."},{"key":"3228_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20224","volume":"33","author":"A. Johansson","year":"2008","unstructured":"A. Johansson, J. Kahn and V. Vu: Factors in random graphs, Random Structures Algorithms 33 (2008), 1\u201328.","journal-title":"Random Structures Algorithms"},{"key":"3228_CR20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J. Koml\u00f3s","year":"1997","unstructured":"J. Koml\u00f3s, G. N. S\u00e1rk\u00f6zy and E. Szemer\u00e9di: Blow-up lemma, Combinatorica 17 (1997), 109\u2013123.","journal-title":"Combinatorica"},{"key":"3228_CR21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","volume":"43","author":"J. Koml\u00f3s","year":"1983","unstructured":"J. Koml\u00f3s and E. Szemer\u00e9di: Limit distribution for the existence of Hamiltonian cycles in a random graph, Discrete Math. 43 (1983), 55\u201363.","journal-title":"Discrete Math."},{"key":"3228_CR22","first-page":"529","volume":"228","author":"A. D. Kor\u0161unov","year":"1976","unstructured":"A. D. Kor\u0161unov: Solution of a problem of P. Erd\u0151s and A. R\u00e9nyi on Hamiltonian cycles in undirected graphs, Dokl. Akad. Nauk SSSR 228 (1976), 529\u2013532.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"3228_CR23","first-page":"17","volume":"90","author":"A. D. Kor\u0161unov","year":"1977","unstructured":"A. D. Kor\u0161unov: Solution of a problem of P. Erd\u0151s and A. R\u00e9nyi on Hamiltonian cycles in nonoriented graphs, Diskret. Analiz, (31 Metody Diskret. Anal. v Teorii Upravljajuscih Sistem) 90 (1977), 17\u201356.","journal-title":"Diskret. Analiz"},{"key":"3228_CR24","doi-asserted-by":"crossref","first-page":"25","DOI":"10.37236\/1177","volume":"19","author":"M. Krivelevich","year":"2012","unstructured":"M. Krivelevich: On the number of Hamilton cycles in pseudo-random graphs, Electron. J. Combin. 19 (2012), Paper 25.","journal-title":"Electron. J. Combin."},{"key":"3228_CR25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/jgt.10065","volume":"42","author":"M. Krivelevich","year":"2003","unstructured":"M. Krivelevich and B. Sudakov: Sparse pseudo-random graphs are Hamiltonian, J. Graph Theory 42 (2003), 17\u201333.","journal-title":"J. Graph Theory"},{"key":"3228_CR26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-3-540-32439-3_10","volume-title":"More sets, graphs and numbers","author":"M. Krivelevich","year":"2006","unstructured":"M. Krivelevich and B. Sudakov: Pseudo-random graphs, in: More sets, graphs and numbers, volume 15 of Bolyai Soc. Math. Stud., 199\u2013262. Springer, Berlin, 2006."},{"key":"3228_CR27","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s00493-004-0025-8","volume":"24","author":"M. Krivelevich","year":"2004","unstructured":"M. Krivelevich, B. Sudakov and T. Szab\u00f3: Triangle factors in sparse pseudorandom graphs, Combinatorica 24 (2004), 403\u2013426.","journal-title":"Combinatorica"},{"key":"3228_CR28","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1137\/120871729","volume":"26","author":"D. K\u00fchn","year":"2012","unstructured":"D. K\u00fchn and D. Osthus: On P\u00f3sa\u2019s conjecture for random graphs, SIAM J. Discrete Math. 26 (2012), 1440\u20131457.","journal-title":"SIAM J. Discrete Math."},{"key":"3228_CR29","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"L. P\u00f3sa","year":"1976","unstructured":"L. P\u00f3sa: Hamiltonian circuits in random graphs, Discrete Math. 14 (1976), 359\u2013364.","journal-title":"Discrete Math."},{"key":"3228_CR30","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0963548399004150","volume":"9","author":"O. Riordan","year":"2000","unstructured":"O. Riordan: Spanning subgraphs of random graphs, Combin. Probab. Comput. 9 (2000), 125\u2013148.","journal-title":"Combin. Probab. Comput."},{"key":"3228_CR31","volume-title":"Some new problems in additive combinatorics","author":"Z. W. Sun","year":"2013","unstructured":"Z. W. Sun: Some new problems in additive combinatorics, arXiv:1309.1679, 2013."},{"key":"3228_CR32","first-page":"307","volume-title":"Random graphs\u2019 85, Lect. 2nd Int. Semin., Pozna\u0144, Poland 1985","author":"A. Thomason","year":"1987","unstructured":"A. Thomason: Pseudo-random graphs, in: Random graphs\u2019 85, Lect. 2nd Int. Semin., Pozna\u0144, Poland 1985, volume 33 of Ann. Discrete Math., 307\u2013331, 1987."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-3228-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3228-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-3228-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T04:48:59Z","timestamp":1601268539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-3228-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,22]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["3228"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-3228-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,22]]}}}