Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments (Q1827718): Difference between revisions

A multipartite tournament is an orientation of a complete multipartite graph. The authors prove a sufficient condition for a multipartite tournament to contain a Hamiltom path starting with a given path. As a corollary, they show that every arc of a regular multipartite tournament is contained in a Hamilton path. They conjecture that every arc of a regular \(c\)-partite tournament is contained in a Hamilton cycle for each \(c\geq 4.\)