The cycle structure of regular multipartite tournaments (Q1613369)

A multipartite tournament is an orientation of a complete graph. A digraph is regular if the indegree and outdegree of every vertex equal the same constant. B. Alspach proved that every arc of a regular tournament is contained in a cycle of length \(n\) for \(n\in \{3,4,\dots, p\}\), where \(p\) is the order of the tournament. The authors prove an interesting extension of this theorem.