Powers of Hamiltonian cycles in multipartite graphs

preprint2022arXivOpen access

Abstract

We prove that if GG is a kk-partite graph on nn vertices in which all of the parts have order at most n/rn/r and every vertex is adjacent to at least a 1−1/r+o(1)1-1/r+o(1) proportion of the vertices in every other part, then GG contains the (r−1)(r-1)-st power of a Hamiltonian cycle

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.