Finding Tight Hamilton Cycles in Random Hypergraphs Faster

  • Peter Allen
  • Christoph Koch
  • Olaf Parczyk
  • Yury Person
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10807)


In an r-uniform hypergraph on n vertices a tight Hamilton cycle consists of n edges such that there exists a cyclic ordering of the vertices where the edges correspond to consecutive segments of r vertices. We provide a first deterministic polynomial time algorithm, which finds a.a.s. tight Hamilton cycles in random r-uniform hypergraphs with edge probability at least \(C \log ^3n/n\).

Our result partially answers a question of Dudek and Frieze (Random Struct Algorithms 42:374–385, 2013) who proved that tight Hamilton cycles exists already for \(p=\omega (1/n)\) for \(r=3\) and \(p=(e + o(1))/n\) for \(r\ge 4\) using a second moment argument. Moreover our algorithm is superior to previous results of Allen et al. (Random Struct Algorithms 46:446–465, 2015) and Nenadov and Škorić (arXiv:1601.04034) in various ways: the algorithm of Allen et al. is a randomised polynomial time algorithm working for edge probabilities \(p\ge n^{-1+\varepsilon }\), while the algorithm of Nenadov and Škorić is a randomised quasipolynomial time algorithm working for edge probabilities \(p\ge C\log ^8n/n\).


  1. 1.
    Allen, P., Böttcher, J., Kohayakawa, Y., Person, Y.: Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 46(3), 446–465 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Angluin, D., Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Syst. Sci. 18(2), 155–193 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Björklund, A.: Determinant sums for undirected Hamiltonicity. SIAM J. Comput. 43(1), 280–299 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bollobás, B.: The evolution of sparse graphs. In: Graph Theory and Combinatorics (Cambridge, 1983), pp. 35–57. Academic Press, London (1984). MR 777163 (86i:05119)Google Scholar
  5. 5.
    Bollobás, B., Fenner, T.I., Frieze, A.: An algorithm for finding Hamilton paths and cycles in random graphs. Combinatorica 7(4), 327–341 (1987). MR 931191 (89h:05049)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Clemens, D., Ehrenmüller, J., Person, Y.: A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs. Discrete Mathematical Days. Extended Abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, 6–8 July 2016, pp. 181–186. Elsevier, Amsterdam (2016)Google Scholar
  7. 7.
    Dudek, A., Frieze, A.: Loose Hamilton cycles in random uniform hypergraphs. Electron. J. Combin. 18(1), Paper 48, 14 (2011). MR 2776824 (2012c:05275)Google Scholar
  8. 8.
    Dudek, A., Frieze, A.: Tight Hamilton cycles in random uniform hypergraphs. Random Struct. Algorithms 42(3), 374–385 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Friedgut, E.: Sharp thresholds of graph properties, and the \(k\)-sat problem. J. Am. Math. Soc. 12(4), 1017–1054 (1999). With an appendix by Jean BourgainMathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Frieze, A.: Loose Hamilton cycles in random 3-uniform hypergraphs. Electron. J. Combin. 17(1), Note 28, 4 (2010). MR 2651737 (2011g:05268)Google Scholar
  11. 11.
    Janson, S., Łuczak, T., Ruciński, A.: Random Graphs. Wiley-Interscience, New York (2000)CrossRefzbMATHGoogle Scholar
  12. 12.
    Johansson, A., Kahn, J., Vu, V.: Factors in random graphs. Random Struct. Algorithms 33(1), 1–28 (2008). 2428975 (2009f:05243)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    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–103. Springer, Boston (1972). CrossRefGoogle Scholar
  14. 14.
    Komlós, J., Szemerédi, E.: Limit distribution for the existence of Hamiltonian cycles in a random graph. Discrete Math. 43(1), 55–63 (1983). MR 680304 (85g:05124)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Korshunov, A.D.: Solution of a problem of Erdős and Renyi on Hamiltonian cycles in non-oriented graphs. Sov. Math. Dokl. 17, 760–764 (1976)Google Scholar
  16. 16.
    Korshunov, A.D.: Solution of a problem of P. Erdős and A. Renyi on Hamiltonian cycles in undirected graphs. Metody Diskretn. Anal. 31, 17–56 (1977)Google Scholar
  17. 17.
    Krivelevich, M.: Triangle factors in random graphs. Comb. Probab. Comput. 6(3), 337–347 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Kühn, D., Osthus, D.: On Pósa’s conjecture for random graphs. SIAM J. Discrete Math. 26(3), 1440–1457 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Montgomery, R.: Embedding bounded degree spanning trees in random graphs. arXiv:1405.6559v2 (2014)
  20. 20.
    Nenadov, R., Škorić, N.: Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs. arXiv preprint arXiv:1601.04034 (2017)
  21. 21.
    Poole, D.: On weak Hamiltonicity of a random hypergraph. arXiv:1410.7446 (2014)
  22. 22.
    Pósa, L.: Hamiltonian circuits in random graphs. Discrete Math. 14(4), 359–364 (1976). MR 0389666 (52 #10497)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Riordan, O.: Spanning subgraphs of random graphs. Comb. Probab. Comput. 9(2), 125–148 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Rödl, V., Ruciński, A., Szemerédi, E.: A Dirac-type theorem for 3-uniform hypergraphs. Combin. Probab. Comput. 15(1–2), 229–251 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Shamir, E.: How many random edges make a graph Hamiltonian? Combinatorica 3(1), 123–131 (1983)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Peter Allen
    • 1
  • Christoph Koch
    • 2
  • Olaf Parczyk
    • 3
  • Yury Person
    • 3
  1. 1.Department of MathematicsLondon School of EconomicsLondonUK
  2. 2.Mathematics InstituteUniversity of WarwickCoventryUK
  3. 3.Institut für MathematikGoethe UniversitätFrankfurt am MainGermany

Personalised recommendations