{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,23]],"date-time":"2025-07-23T12:07:15Z","timestamp":1753272435016},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,6,23]],"date-time":"2014-06-23T00:00:00Z","timestamp":1403481600000},"content-version":"tdm","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":[[2014,10]]},"DOI":"10.1007\/s00493-014-2956-z","type":"journal-article","created":{"date-parts":[[2014,6,23]],"date-time":"2014-06-23T17:11:37Z","timestamp":1403543497000},"page":"573-596","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal covers with Hamilton cycles in random graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Dan","family":"Hefetz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"K\u00fchn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Lapinskas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deryk","family":"Osthus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,23]]},"reference":[{"key":"2956_CR1","first-page":"173","volume":"27","author":"M. Ajtai","year":"1985","unstructured":"M. Ajtai, J. Koml\u00f3s and E. Szemer\u00e9di: The first occurrence of Hamilton cycles in random graphs, Annals of Discrete Mathematics 27 (1985), 173\u2013178.","journal-title":"Annals of Discrete Mathematics"},{"key":"2956_CR2","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1137\/110821299","volume":"25","author":"S. Ben-Shimon","year":"2011","unstructured":"S. Ben-Shimon, M. Krivelevich and B. Sudakov: On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs, SIAM J. Discrete Mathematics 25 (2011), 1176\u20131193.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"2956_CR3","first-page":"35","volume-title":"Graph Theory and Combinatorics","author":"B. Bollob\u00e1s","year":"1984","unstructured":"B. Bollob\u00e1s: The evolution of sparse graphs, Graph Theory and Combinatorics, Academic Press, London (1984), 35\u201357."},{"key":"2956_CR4","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s: Random Graphs, Academic Press, London, 1985."},{"key":"2956_CR5","series-title":"North-Holland Math. Stud.","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0304-0208(08)73611-9","volume-title":"Random graphs\u2019 83","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s and A. Frieze: On matchings and Hamiltonian cycles in random graphs, Random graphs\u2019 83 (Poznan, 1983), North-Holland Math. Stud., 118, North-Holland, Amsterdam (1985), 23\u201346."},{"key":"2956_CR6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.jctb.2004.12.003","volume":"94","author":"A. Frieze","year":"2005","unstructured":"A. Frieze and M. Krivelevich: On packing Hamilton cycles in \u025b-regular graphs, J. Combin. Theory B 94 (2005), 159\u2013172.","journal-title":"J. Combin. Theory B"},{"key":"2956_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s11856-008-1028-8","volume":"166","author":"A. Frieze","year":"2008","unstructured":"A. Frieze and M. Krivelevich: On two Hamilton cycle problems in random graphs, Israel J. Math. 166 (2008), 221\u2013234.","journal-title":"Israel J. Math."},{"key":"2956_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1002\/rsa.20455","volume":"44","author":"R. Glebov","year":"2014","unstructured":"R. Glebov, M. Krivelevich and T. Szab\u00f3: On covering expander graphs by Hamilton cycles, Random Structures & Algorithms 44 (2014), 183\u2013200.","journal-title":"Random Structures & Algorithms"},{"key":"2956_CR9","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s00493-009-2362-0","volume":"29","author":"D. Hefetz","year":"2009","unstructured":"D. Hefetz, M. Krivelevich and T. Szab\u00f3: Hamilton cycles in highly connected and expanding graphs, Combinatorica 29 (2009), 547\u2013568.","journal-title":"Combinatorica"},{"key":"2956_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random graphs","author":"S. Janson","year":"2000","unstructured":"S. Janson, T. \u0141uczak and A. Ruci\u0144ski: Random graphs, Wiley-Interscience, 2000."},{"key":"2956_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1002\/rsa.20365","volume":"40","author":"F. Knox","year":"2012","unstructured":"F. Knox, D. K\u00fchn and D. Osthus: Approximate Hamilton decompositions of random graphs, Random Structures & Algorithms 40 (2012), 133\u2013149.","journal-title":"Random Structures & Algorithms"},{"key":"2956_CR12","unstructured":"F. Knox, D. K\u00fchn and D. Osthus: Edge-disjoint Hamilton cycles in random graphs, Random Structures & Algorithms (to appear)."},{"key":"2956_CR13","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/110849171","volume":"26","author":"M. Krivelevich","year":"2012","unstructured":"M. Krivelevich and W. Samotij: Optimal packings of Hamilton cycles in sparse random graphs, SIAM J. Discrete Mathematics 26 (2012), 964\u2013982.","journal-title":"SIAM J. Discrete Mathematics"},{"key":"2956_CR14","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.aim.2013.01.005","volume":"237","author":"D. K\u00fchn","year":"2013","unstructured":"D. K\u00fchn and D. Osthus: Hamilton decompositions of regular expanders: a proof of Kelly\u2019s conjecture for large tournaments, Advances in Mathematics 237 (2013), 62\u2013146.","journal-title":"Advances in Mathematics"},{"key":"2956_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2013.10.006","volume":"104","author":"D. K\u00fchn","year":"2014","unstructured":"D. K\u00fchn and D. Osthus: Hamilton decompositions of regular expanders: applications, J. Combin. Theory B 104 (2014), 1\u201327.","journal-title":"J. Combin. Theory B"},{"key":"2956_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"6","author":"V. R\u00f6dl","year":"1985","unstructured":"V. R\u00f6dl: On a packing and covering problem, European J. Combin. 6 (1985), 69\u201378.","journal-title":"European J. Combin."},{"key":"2956_CR17","first-page":"307","volume":"33","author":"A. Thomason","year":"1987","unstructured":"A. Thomason: Pseudo-random graphs, Annals of Discrete Mathematics 33 (1987), 307\u2013331.","journal-title":"Annals of Discrete Mathematics"},{"key":"2956_CR18","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W. Tutte","year":"1952","unstructured":"W. Tutte: The factors of graphs, Canad. J. Math. 4 (1952), 314\u2013328.","journal-title":"Canad. J. Math."},{"key":"2956_CR19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"W. Tutte","year":"1954","unstructured":"W. Tutte: A short proof of the factor theorem for finite graphs, Canad. J. Math. 6 (1954), 347\u2013352.","journal-title":"Canad. J. Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2956-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2956-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2956-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:50Z","timestamp":1559079170000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2956-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,23]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["2956"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2956-z","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,23]]}}}