Powers of Hamiltonian cycles in multipartite graphs
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 $11/r+o(1)$ proportion of the vertices in every other part, then $G$ contains the $(r1)$st power of a Hamiltonian cycle
 Publication:

arXiv eprints
 Pub Date:
 June 2021
 arXiv:
 arXiv:2106.11223
 Bibcode:
 2021arXiv210611223D
 Keywords:

 Mathematics  Combinatorics
 EPrint:
 23 pages, 3 figures