Families of triples with high minimum degree are hamiltonian

Abstract In this paper we show that every family of triples, that is, a 3-uniform hypergraph, with minimum degree at least contains a tight Hamiltonian cycle

[1]  E. Szemerédi,et al.  A note on perfect matchings in uniform hypergraphs with large minimum collective degree , 2008 .

[2]  Hiêp Hàn,et al.  On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree , 2009, SIAM J. Discret. Math..

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

[4]  Oleg Pikhurko,et al.  Perfect Matchings and K43-Tilings in Hypergraphs of Large Codegree , 2008, Graphs Comb..

[5]  Ron Aharoni,et al.  Perfect matchings in r-partite r-graphs , 2009, Eur. J. Comb..

[6]  Imdadullah Khan,et al.  Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree , 2011, SIAM J. Discret. Math..

[7]  Vojtech Rödl,et al.  Perfect matchings in large uniform hypergraphs with large minimum collective degree , 2009, J. Comb. Theory, Ser. A.

[8]  Vojtech Rödl,et al.  An approximate Dirac-type theorem for k-uniform hypergraphs , 2008, Comb..

[9]  Zsófia Osváth,et al.  DOI: 10 , 2011 .

[10]  Daniela Kühn,et al.  Hamilton l-cycles in uniform hypergraphs , 2009, J. Comb. Theory, Ser. A.

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

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

[13]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

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

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

[16]  Daniela Kühn,et al.  Loose Hamilton cycles in hypergraphs , 2008, Discret. Math..

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

[18]  Hiêp Hàn,et al.  Dirac-type results for loose Hamilton cycles in uniform hypergraphs , 2010, J. Comb. Theory, Ser. B.

[19]  Daniela Kühn,et al.  Matchings in hypergraphs of large minimum degree , 2006 .

[20]  Vojtech Rödl,et al.  Perfect matchings in uniform hypergraphs with large minimum degree , 2006, Eur. J. Comb..

[21]  Endre Szemer,et al.  AN APPROXIMATE DIRAC-TYPE THEOREM FOR k-UNIFORM HYPERGRAPHS , 2008 .

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

[23]  Daniela Kühn,et al.  Matchings in 3-uniform hypergraphs , 2010, J. Comb. Theory, Ser. B.