论文信息 - Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

Minimum vertex degree conditions for loose Hamilton cycles in 3-uniform hypergraphs

Abstract We investigate minimum vertex degree conditions for 3-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which consecutive edges intersect in a single vertex. We prove that every 3-uniform n-vertex (n even) hypergraph H with minimum vertex degree δ 1 ( H ) ⩾ ( 7 16 + o ( 1 ) ) ( n 2 ) contains a loose Hamilton cycle. This bound is asymptotically best possible.

Hiêp Hàn | Mathias Schacht | Enno Buß

[1] Benny Sudakov,et al. Triangle packings and 1-factors in oriented graphs , 2008, J. Comb. Theory, Ser. B.

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

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

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

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

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

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

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

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

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

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