Abstract
We prove that if G is a k-partite graph on n vertices in which all of the parts have order at most n/r and every vertex is adjacent to at least a 1−1/r+o(1) proportion of the vertices in every other part, then G contains the (r−1)-st power of a Hamiltonian cycle.
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.
