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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
