27 citations · 104 across the 10 of their papers we have counts for
1 paper · 2 filters
Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht +1
We show that every 3-uniform hypergraph with minimum vertex degree at least 0.8(2n−1) contains a tight Hamiltonian cycle.