Abstract
We show that every 3-uniform hypergraph with minimum vertex degree at least 0.8 \(\left(\begin{array}{c}n-1\\2\end{array}\right)\) contains a tight Hamiltonian cycle.
Similar content being viewed by others
References
Berge, C.: Graphs and Hypergraphs. North-Holland Publishing Co., Amsterdam-London; American Elsevier Publishing Co., Inc., New York (1973)
Bermond, J.-C., Germa, A., Heydemann, M.-C., Sotteau, D.: Hypergraphes hamiltoniens. In: Problémes Combinatoires et Théorie des Graphes, pp. 39–43. CNRS, Paris (1978)
Bollobás, B.: Extremal Graph Theory. Dover Publications, Inc., Mineola, NY (2004)
Buß E., Hán H., Schacht M.: Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs. J. Combin. Theory Ser. B 103(6), 658–678 (2013)
Chung F.R.K.: Regularity lemmas for hypergraphs and quasi-randomness. Random Structures Algorithms 2(2), 241–252 (1991)
Dirac G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. (3) 2, 69–81 (1952)
Erdős P.: On extremal problems of graphs and generalized graphs. Israel J. Math. 2, 183–190 (1964)
Frankl P., Rödl V.: The uniformity lemma for hypergraphs. Graphs Combin. 8(4), 309–312 (1992)
Glebov R., Person Y., Weps W.: On extremal hypergraphs for Hamiltonian cycles. European J. Combin. 33(4), 544–555 (2012)
Goodman A.W.: On sets of acquaintances and strangers at any party. Amer. Math. Monthly 66, 778–783 (1959)
Hàn H., Person Y., Schacht M.: On perfect matchings in uniform hypergraphs with large minimum vertex degree. SIAM J. Discrete Math. 23(2), 732–748 (2009)
Hàn H., Schacht M.: Dirac-type results for loose Hamilton cycles in uniform hypergraphs. J. Combin. Theory Ser. B 100(3), 332–346 (2010)
Han J., Zhao Y.: Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs. J. Combin. Theory Ser. B 114, 70–96 (2015)
Han, J., Zhao, Y.: Forbidding Hamilton cycles in uniform hypergraphs. arXiv:1508.05623 (2015)
Janson, S., Łuczak, T., Ruci´nski, A.: Random Graphs. Wiley-Interscience, New York (2000)
Katona G.Y., Kierstead H.A.: Hamiltonian chains in hypergraphs. J. Graph Theory 30(3), 205–212 (1999)
Keevash D., Kühn P., Mycroft R., Osthus D.: Loose Hamilton cycles in hypergraphs. Discrete Math. 311(7), 544–559 (2011)
Khan I.: Perfect matchings in 3-uniform hypergraphs with large vertex degree. SIAM J. Discrete Math. 27(2), 1021–1039 (2013)
Kühn D., Mycroft R., Osthus D.: Hamilton \({\ell}\)-cycles in uniform hypergraphs. J. Combin. Theory Ser. A 117(7), 910–927 (2010)
Kühn D., Osthus D.: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree. J. Combin. Theory Ser. B 96(6), 767–821 (2006)
Kühn D., Osthus D., Treglown A.: Matchings in 3-uniform hypergraphs. J. Combin. Theory Ser. B 103(2), 291–305 (2013)
Markström K., Ruciński A.: Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees. European J. Combin. 32(5), 677–687 (2011)
Moon J.W., Moser L.: On a problem of Turán.Magyar Tud. Akad. Mat. Kutató Int. Közl. 7, 283–286 (1962)
Nordhaus E.A., Stewart B.M.: Triangles in an ordinary graph. Canad. J. Math. 15, 33–41 (1963)
Razborov A.A.: On the minimal density of triangles in graphs. Combin. Probab. Comput. 17(4), 603–618 (2008)
Rödl, V., Ruciński, A.: Dirac-type questions for hypergraphs — a survey (or more problems for Endre to solve). In: Bárány, I., Solymosi, J., Sági, G. (eds.) An Irregular Mind, pp. 561–590. János Bolyai Math. Soc., Budapest (2010)
Rödl V., Ruciński A.: Families of triples with high minimum degree are Hamiltonian. Discuss. Math. Graph Theory 34(2), 361–381 (2014)
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)
Rödl V., Ruciński A., Szemerédi E.: An approximate Dirac-type theorem for k-uniform hypergraphs. Combinatorica 28(2), 229–260 (2008)
Rödl V., Ruciński A., Szemerédi E.: Perfect matchings in large uniform hypergraphs with large minimum collective degree. J. Combin. Theory Ser. A 116(3), 613–636 (2009)
Rödl V., Ruciński A., Szemerédi E.: Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs. Adv. Math. 227(3), 1225–1299 (2011)
Steger, A.: Die Kleitman-Rothschild methode. PhD thesis. Forschungsinstitut für Diskrete Mathematik, Rheinische Friedrichs-Wilhelms-Universität Bonn (1990)
Szemerédi, E.: Regular partitions of graphs. In: Problèmes Combinatoires et Théorie des Graphes, pp. 399–401. CNRS, Paris (1978)
Author information
Authors and Affiliations
Corresponding author
Additional information
V. Rödl was supported by NSF grant DMS 1301698. A. Ruciński was supported by the Polish NSC grant 2014/15/B/ST1/01688. M. Schacht was supported through the Heisenberg-Programme of the DFG. Part of this research was carried out during research stays of A. Ruciński and M. Schacht at Emory University.
Rights and permissions
About this article
Cite this article
Rödl, V., Ruciński, A., Schacht, M. et al. On the Hamiltonicity of Triple Systems with High Minimum Degree. Ann. Comb. 21, 95–117 (2017). https://doi.org/10.1007/s00026-017-0345-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-017-0345-1