2000 character limit reached
On the Hamiltonicity of triple systems with high minimum degree
Published 3 May 2016 in math.CO | (1605.00773v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.