Hamiltonicity in Cherry-quasirandom 3-graphs
Abstract
We show that for any fixed α>0, cherry-quasirandom 3-graphs of positive density and sufficiently large order n with minimum vertex degree α n2 have a tight Hamilton cycle. This solves a conjecture of Aigner-Horev and Levy.
0