Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs

We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $(5/9+o(1))\binom{n}2$ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.

[1]  E. Szemerédi,et al.  Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs , 2011 .

[2]  G. Dirac.  Some Theorems on Abstract Graphs , 1952 .

[3]  Yi Zhao,et al.  Recent advances on Dirac-type problems for hypergraphs , 2015, 1508.06170.

[4]  Yi Zhao,et al.  Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs , 2013, J. Comb. Theory, Ser. B.

[5]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[6]  Richard H. Schelp,et al.  Path Ramsey numbers in multicolorings , 1975 .

[7]  Vojtech Rödl,et al.  A Dirac-Type Theorem for 3-Uniform Hypergraphs , 2006, Combinatorics, Probability and Computing.

[8]  P. Erdos,et al.  On maximal paths and circuits of graphs , 1959 .

[9]  Andrzej Czygrinow,et al.  Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs , 2013, SIAM J. Discret. Math..

[10]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

[11]  Vojtech Rödl,et al.  Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve) , 2010 .

[12]  Yury Person,et al.  On extremal hypergraphs for Hamiltonian cycles , 2011, Eur. J. Comb..

[13]  Richard Mycroft,et al.  The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph , 2016, Discret. Math..

[14]  Hiêp Hàn,et al.  Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs , 2011, Electron. Notes Discret. Math..

[15]  Vojtech Rödl,et al.  Families of triples with high minimum degree are hamiltonian , 2014, Discuss. Math. Graph Theory.

[16]  E. Szemerédi,et al.  On the Hamiltonicity of Triple Systems with High Minimum Degree , 2016, 1605.00773.

[17]  Gyula Y. Katona,et al.  Generating quadrangulations of surfaces with minimum degree at least 3 , 1999 .

[18]  G. R. Blakley,et al.  A Hölder type inequality for symmetric matrices with nonnegative entries , 1965 .

[19]  Daniela Kühn,et al.  Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree , 2006, J. Comb. Theory, Ser. B.

[20]  Béla Bollobás,et al.  Random Graphs , 1985 .

[21]  M. Simonovits,et al.  Cube-Supersaturated Graphs and Related Problems , 1982 .