{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:32:33Z","timestamp":1743031953744,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774039"},{"type":"electronic","value":"9783319774046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_3","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"28-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Tight Hamilton Cycles in Random Hypergraphs Faster"],"prefix":"10.1007","author":[{"given":"Peter","family":"Allen","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Koch","sequence":"additional","affiliation":[]},{"given":"Olaf","family":"Parczyk","sequence":"additional","affiliation":[]},{"given":"Yury","family":"Person","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1002\/rsa.20519","volume":"46","author":"P Allen","year":"2015","unstructured":"Allen, P., B\u00f6ttcher, J., Kohayakawa, Y., Person, Y.: Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 46(3), 446\u2013465 (2015)","journal-title":"Random Struct. Algorithms"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0022-0000(79)90045-X","volume":"18","author":"D Angluin","year":"1979","unstructured":"Angluin, D., Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Syst. Sci. 18(2), 155\u2013193 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/110839229","volume":"43","author":"A Bj\u00f6rklund","year":"2014","unstructured":"Bj\u00f6rklund, A.: Determinant sums for undirected Hamiltonicity. SIAM J. Comput. 43(1), 280\u2013299 (2014)","journal-title":"SIAM J. Comput."},{"key":"3_CR4","unstructured":"Bollob\u00e1s, B.: The evolution of sparse graphs. In: Graph Theory and Combinatorics (Cambridge, 1983), pp. 35\u201357. Academic Press, London (1984). MR 777163 (86i:05119)"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF02579321","volume":"7","author":"B Bollob\u00e1s","year":"1987","unstructured":"Bollob\u00e1s, B., Fenner, T.I., Frieze, A.: An algorithm for finding Hamilton paths and cycles in random graphs. Combinatorica 7(4), 327\u2013341 (1987). MR 931191 (89h:05049)","journal-title":"Combinatorica"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Clemens, D., Ehrenm\u00fcller, J., Person, Y.: A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs. Discrete Mathematical Days. Extended Abstracts of the 10th \u201cJornadas de matem\u00e1tica discreta y algor\u00edtmica\u201d (JMDA), Barcelona, Spain, 6\u20138 July 2016, pp. 181\u2013186. Elsevier, Amsterdam (2016)","DOI":"10.1016\/j.endm.2016.09.032"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Dudek, A., Frieze, A.: Loose Hamilton cycles in random uniform hypergraphs. Electron. J. Combin. 18(1), Paper 48, 14 (2011). MR 2776824 (2012c:05275)","DOI":"10.37236\/535"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1002\/rsa.20404","volume":"42","author":"A Dudek","year":"2013","unstructured":"Dudek, A., Frieze, A.: Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms 42(3), 374\u2013385 (2013)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E Friedgut","year":"1999","unstructured":"Friedgut, E.: Sharp thresholds of graph properties, and the $$k$$-sat problem. J. Am. Math. Soc. 12(4), 1017\u20131054 (1999). With an appendix by Jean Bourgain","journal-title":"J. Am. Math. Soc."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Frieze, A.: Loose Hamilton cycles in random 3-uniform hypergraphs. Electron. J. Combin. 17(1), Note 28, 4 (2010). MR 2651737 (2011g:05268)","DOI":"10.37236\/477"},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley-Interscience, New York (2000)"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","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 Struct. Algorithms 33(1), 1\u201328 (2008). 2428975 (2009f:05243)","journal-title":"Random Struct. Algorithms"},{"key":"3_CR13","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"3_CR14","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. 43(1), 55\u201363 (1983). MR 680304 (85g:05124)","journal-title":"Discrete Math."},{"key":"3_CR15","first-page":"760","volume":"17","author":"AD Korshunov","year":"1976","unstructured":"Korshunov, A.D.: Solution of a problem of Erd\u0151s and Renyi on Hamiltonian cycles in non-oriented graphs. Sov. Math. Dokl. 17, 760\u2013764 (1976)","journal-title":"Sov. Math. Dokl."},{"key":"3_CR16","first-page":"17","volume":"31","author":"AD Korshunov","year":"1977","unstructured":"Korshunov, A.D.: Solution of a problem of P. Erd\u0151s and A. Renyi on Hamiltonian cycles in undirected graphs. Metody Diskretn. Anal. 31, 17\u201356 (1977)","journal-title":"Metody Diskretn. Anal."},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1017\/S0963548397003106","volume":"6","author":"M Krivelevich","year":"1997","unstructured":"Krivelevich, M.: Triangle factors in random graphs. Comb. Probab. Comput. 6(3), 337\u2013347 (1997)","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"3_CR18","doi-asserted-by":"publisher","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."},{"key":"3_CR19","unstructured":"Montgomery, R.: Embedding bounded degree spanning trees in random graphs. arXiv:1405.6559v2 (2014)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Nenadov, R., \u0160kori\u0107, N.: Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs. arXiv preprint arXiv:1601.04034 (2017)","DOI":"10.1002\/rsa.20782"},{"key":"3_CR21","unstructured":"Poole, D.: On weak Hamiltonicity of a random hypergraph. arXiv:1410.7446 (2014)"},{"issue":"4","key":"3_CR22","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 Math. 14(4), 359\u2013364 (1976). MR 0389666 (52 #10497)","journal-title":"Discrete Math."},{"issue":"2","key":"3_CR23","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. Comb. Probab. Comput. 9(2), 125\u2013148 (2000)","journal-title":"Comb. Probab. Comput."},{"issue":"1\u20132","key":"3_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1017\/S0963548305007042","volume":"15","author":"V R\u00f6dl","year":"2006","unstructured":"R\u00f6dl, V., Ruci\u0144ski, A., Szemer\u00e9di, E.: A Dirac-type theorem for 3-uniform hypergraphs. Combin. Probab. Comput. 15(1\u20132), 229\u2013251 (2006)","journal-title":"Combin. Probab. Comput."},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02579348","volume":"3","author":"E Shamir","year":"1983","unstructured":"Shamir, E.: How many random edges make a graph Hamiltonian? Combinatorica 3(1), 123\u2013131 (1983)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:00:30Z","timestamp":1709827230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}