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 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
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.