{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T15:36:12Z","timestamp":1775835372537,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642544224","type":"print"},{"value":"9783642544231","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_31","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"355-366","source":"Crossref","is-referenced-by-count":1,"title":["Powers of Hamilton Cycles in Pseudorandom Graphs"],"prefix":"10.1007","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\u00ea\u0323p","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","reference":[{"key":"31_CR1","unstructured":"Allen, P., B\u00f6ttcher, J., H\u00e0n, H., Kohayakawa, Y., Person, Y.: Blow-up lemmas for sparse graphs (in preparation)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Allen, P., B\u00f6ttcher, J., Kohayakawa, Y., Person, Y.: Tight Hamilton cycles in random hypergraphs. Random Structures Algorithms (to appear), doi: 10.1002\/rsa.20519","DOI":"10.1002\/rsa.20519"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N.: Explicit Ramsey graphs and orthonormal labelings. Electronic Journal of Combinatorics 1, Research paper 12, 8pp (1994)","DOI":"10.37236\/1192"},{"issue":"2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1002\/rsa.20143","volume":"31","author":"N. Alon","year":"2007","unstructured":"Alon, N., Capalbo, M.: Sparse universal graphs for bounded-degree graphs. Random Structures Algorithms\u00a031(2), 123\u2013133 (2007)","journal-title":"Random Structures Algorithms"},{"key":"31_CR5","unstructured":"Alon, N., Capalbo, M., Kohayakawa, Y., R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: Universality and tolerance (extended abstract). In: Proc. 41 IEEE FOCS, pp. 14\u201321. IEEE (2000)"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Alon, N., Spencer, J.H.: The probabilistic method, vol.\u00a057. Wiley Interscience (2000)","DOI":"10.1002\/0471722154"},{"key":"31_CR7","first-page":"35","volume-title":"Graph theory and combinatorics (Cambridge, 1983)","author":"B. Bollob\u00e1s","year":"1984","unstructured":"Bollob\u00e1s, B.: The evolution of sparse graphs. In: Graph theory and combinatorics (Cambridge, 1983), pp. 35\u201357. Academic Press, London (1984)"},{"key":"31_CR8","unstructured":"B\u00f6ttcher, J., Kohayakawa, Y., Taraz, A., W\u00fcrfl, A.: An extension of the blow-up lemma to arrangeable graphs, arXiv:1305.2059"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"F.R.K. Chung","year":"1989","unstructured":"Chung, F.R.K., Graham, R.L., Wilson, R.M.: Quasi-random graphs. Combinatorica\u00a09(4), 345\u2013362 (1989)","journal-title":"Combinatorica"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s004930200010","volume":"22","author":"F. Chung","year":"2002","unstructured":"Chung, F., Graham, R.: Sparse quasi-random graphs. Combinatorica\u00a022(2), 217\u2013244 (2002)","journal-title":"Combinatorica"},{"key":"31_CR11","unstructured":"Conlon, D.: Talk at RSA 2013 (2013)"},{"key":"31_CR12","unstructured":"Conlon, D., Fox, J., Zhao, Y.: Extremal results in sparse pseudorandom graphs. arXiv:1204.6645"},{"issue":"6","key":"31_CR13","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1002\/jgt.3190130608","volume":"13","author":"C. Cooper","year":"1989","unstructured":"Cooper, C., Frieze, A.M.: On the number of Hamilton cycles in a random graph. J. Graph Theory\u00a013(6), 719\u2013735 (1989)","journal-title":"J. Graph Theory"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-29344-3_20","volume-title":"LATIN 2012: Theoretical Informatics","author":"D. Dellamonica Jr.","year":"2012","unstructured":"Dellamonica Jr., D., Kohayakawa, Y., R\u00f6dl, V., Ruci\u0144ski, A.: An improved upper bound on the density of universal random graphs. In: Fern\u00e1ndez-Baca, D. (ed.) LATIN 2012. LNCS, vol.\u00a07256, pp. 231\u2013242. Springer, Heidelberg (2012)"},{"issue":"1","key":"31_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1017\/S0963548300001012","volume":"3","author":"S. Janson","year":"1994","unstructured":"Janson, S.: The numbers of spanning trees, Hamilton cycles and perfect matchings in a random graph. Combin. Probab. Comput.\u00a03(1), 97\u2013126 (1994)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"31_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/rsa.20224","volume":"33","author":"A. Johansson","year":"2008","unstructured":"Johansson, A., Kahn, J., Vu, V.: Factors in random graphs. Random Structures Algorithms\u00a033(1), 1\u201328 (2008)","journal-title":"Random Structures Algorithms"},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01196135","volume":"17","author":"J. Koml\u00f3s","year":"1997","unstructured":"Koml\u00f3s, J., S\u00e1rk\u00f6zy, G.N., Szemer\u00e9di, E.: Blow-up lemma. Combinatorica\u00a017(1), 109\u2013123 (1997)","journal-title":"Combinatorica"},{"issue":"1","key":"31_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","volume":"43","author":"J. Koml\u00f3s","year":"1983","unstructured":"Koml\u00f3s, J., Szemer\u00e9di, E.: Limit distribution for the existence of Hamiltonian cycles in a random graph. Discrete Math.\u00a043(1), 55\u201363 (1983)","journal-title":"Discrete Math."},{"key":"31_CR19","first-page":"760","volume":"17","author":"A.D. Korshunov","year":"1976","unstructured":"Korshunov, A.D.: Solution of a problem of Erd\u0151s and Renyi on Hamiltonian cycles in nonoriented graphs. Sov. Math., Dokl.\u00a017, 760\u2013764 (1976)","journal-title":"Sov. Math., Dokl."},{"key":"31_CR20","first-page":"17","volume":"31","author":"A.D. Korshunov","year":"1977","unstructured":"Korshunov, A.D.: Solution of a problem of P.\u00a0Erd\u0151s and A.\u00a0Renyi on Hamiltonian cycles in undirected graphs. Metody Diskretn. Anal.\u00a031, 17\u201356 (1977)","journal-title":"Metody Diskretn. Anal."},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Krivelevich, M.: On the number of Hamilton cycles in pseudo-random graphs. Electron. J. Combin.\u00a019(1), Paper 25, 14pp (2012)","DOI":"10.37236\/1177"},{"issue":"1","key":"31_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/jgt.10065","volume":"42","author":"M. Krivelevich","year":"2003","unstructured":"Krivelevich, M., Sudakov, B.: Sparse pseudo-random graphs are Hamiltonian. J. Graph Theory\u00a042(1), 17\u201333 (2003)","journal-title":"J. Graph Theory"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-32439-3_10","volume":"15","author":"M. Krivelevich","year":"2006","unstructured":"Krivelevich, M., Sudakov, B.: Pseudo-random graphs, More sets, graphs and numbers. Bolyai Soc. Math. Stud.\u00a015, 199\u2013262 (2006)","journal-title":"Bolyai Soc. Math. Stud."},{"issue":"3","key":"31_CR24","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s00493-004-0025-8","volume":"24","author":"M. Krivelevich","year":"2004","unstructured":"Krivelevich, M., Sudakov, B., Szab\u00f3, T.: Triangle factors in sparse pseudo-random graphs. Combinatorica\u00a024(3), 403\u2013426 (2004)","journal-title":"Combinatorica"},{"issue":"3","key":"31_CR25","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1137\/120871729","volume":"26","author":"D. K\u00fchn","year":"2012","unstructured":"K\u00fchn, D., Osthus, D.: On P\u00f3sa\u2019s conjecture for random graphs. SIAM J. Discrete Math. 26(3), 1440\u20131457 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"31_CR26","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0012-365X(76)90068-6","volume":"14","author":"L. P\u00f3sa","year":"1976","unstructured":"P\u00f3sa, L.: Hamiltonian circuits in random graphs. Discrete Mathematics\u00a014(4), 359\u2013364 (1976)","journal-title":"Discrete Mathematics"},{"issue":"2","key":"31_CR27","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1017\/S0963548399004150","volume":"9","author":"O. Riordan","year":"2000","unstructured":"Riordan, O.: Spanning subgraphs of random graphs. Combin. Probab. Comput.\u00a09(2), 125\u2013148 (2000)","journal-title":"Combin. Probab. Comput."},{"key":"31_CR28","first-page":"307","volume":"85","author":"A. Thomason","year":"1987","unstructured":"Thomason, A.: Pseudo-random graphs. Random Graphs\u00a085, 307\u2013331 (1987)","journal-title":"Random Graphs"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,16]],"date-time":"2020-08-16T19:15:13Z","timestamp":1597605313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}