Abstract
AbstractFor integers and , we show that for every , there exists such that the union of ‐uniform hypergraph on vertices with minimum codegree at least and a binomial random ‐uniform hypergraph with on the same vertex set contains the power of a tight Hamilton cycle with high probability. Moreover, a construction shows that one cannot take , where is a constant. Thus the bound on is optimal up to the value of and this answers a question of Bedenknecht, Han, Kohayakawa, and Mota.
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.
