Spanning Structures in Multipartite Graph Traversals
Let $G$ be an $r$-partite graph such that the edge density between any two parts is at least $\alpha$. We consider the problem of determining how large $\alpha$ must be in order to guarantee that $G$ has a Hamiltonian traversal (an $r$-cycle subgraph containing exactly one vertex from each part), and show that this cri...