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 only consecutive edges intersect and these intersections consist of precisely one vertex. We prove that every $3$-uniform $n$-vertex ($n$ even) hypergraph $\mathcal{H}$ with minimum vertex degree ${\delta }_1(\mathcal{H})\ge \left(\frac{7}{16}+o(1)\right)\left(\genfrac{}{}{0ex}{}{n}{2}\right)$ contains a loose Hamilton cycle. This bound is asymptotically best possible.

References in corpus (2)

• Hamilton l-cycles in uniform hypergraphs
• Loose Hamilton cycles in hypergraphs

Cited by in corpus (16)

• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs
• Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs
• Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
• Loose Hamiltonian cycles forced by large $(k-2)$-degree - approximate version
• Hamiltonicity in randomly perturbed hypergraphs
• On the Hamiltonicity of triple systems with high minimum degree
• Codegree conditions for tiling complete $k$-partite $k$-graphs and loose cycles
• Hamiltonicity in Cherry-quasirandom 3-graphs
• Forbidding Hamilton cycles in uniform hypergraphs
• Tight Hamilton cycles in cherry quasirandom $3$-uniform hypergraphs
• Transversal Hamilton cycle in hypergraph systems
• Cover 3-uniform hypergraphs by vertex-disjoint tight paths
• Hamilton cycles in quasirandom hypergraphs
• Large $Y_{k,b}$-tilings and Hamilton $\ell$-cycles in $k$-uniform hypergraphs
• A rainbow Dirac theorem for loose Hamilton cycles in hypergraphs