Tight co-degree condition for the existence of loose Hamilton cycles in 3-graphs

Abstract

In 2006, Kühn and Osthus showed that if a 3-graph H on n vertices has minimum co-degree at least (1/4 +o(1))n and n is even then H has a loose Hamilton cycle. In this paper, we prove that the minimum co-degree of n/4 suffices. The result is tight.

9 pages, 5 figures

Cited by in corpus (2)

• Hamilton cycles in graphs and hypergraphs: an extremal perspective
• Transversal Hamilton cycle in hypergraph systems