On the Hamiltonicity of triple systems with high minimum degree

arxiv: 1605.00773 · v2 · pith:IKFIJFHSnew · submitted 2016-05-03 · 🧮 math.CO

Vojt\v{e}ch R\"odl , Andrzej Ruci\'nski , Mathias Schacht , Endre Szemer\'edi This is my paper

classification 🧮 math.CO

keywords degreeminimumbinomcontainscycleeveryhamiltonianhamiltonicity

0 comments

read the original abstract

We show that every 3-uniform hypergraph with minimum vertex degree at least $0.8\binom{n-1}{2}$ contains a tight Hamiltonian cycle.

This paper has not been read by Pith yet.