Papers
Topics
Authors
Recent
Search
2000 character limit reached

Minimum pair degree condition for tight Hamiltonian cycles in $4$-uniform hypergraphs

Published 7 May 2020 in math.CO | (2005.03391v1)

Abstract: We show that every 4-uniform hypergraph with $n$ vertices and minimum pair degree at least $(5/9+o(1))n2/2$ contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up