On the Hamiltonicity of triple systems with high minimum degree

17 May 2016  ·  Rödl Vojtěch, Ruciński Andrzej, Schacht Mathias, Szemerédi Endre ·

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

PDF Abstract
No code implementations yet. Submit your code now

Categories


Combinatorics