Abstract
For 1≤ℓ<k/2, we show that for sufficiently large n, every k-uniform hypergraph on n vertices with minimum codegree at least n2(k−ℓ) contains a Hamilton ℓ-cycle. This codegree condition is best possible and improves on work of Hàn and Schacht who proved an asymptotic result.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
