On Cycles in Multipartite Tournaments

An n-partite tournament is an orientation of a complete n-partite graph. We show that if D is a strongly connected n-partite tournament, and if v is the only vertex in one of the partite sets of D, then for any m, 3 ≤ m ≤ n, there is an m-cycle of D containing v. This generalizes a theorem of Moon.