Abstract
We investigate minimum vertex degree conditions for 3-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which only consecutive edges intersect and these intersections consist of precisely one vertex.We prove that every 3-uniform n-vertex (n even) hypergraph H with minimum vertex degree δ1(H)⩾(716+o(1))(n2) contains a loose Hamilton cycle. This bound is asymptotically best possible.
Sign-in/Register to access full text options 
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.
