Hamiltonicity in Cherry-quasirandom 3-graphs

Abstract

We show that for any fixed $\alpha >0$, cherry-quasirandom 3-graphs of positive density and sufficiently large order $n$ with minimum vertex degree $\alpha \left(\genfrac{}{}{0ex}{}{n}{2}\right)$ have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and Levy.

8 pages

Cited by in corpus (1)

• Localised codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs