Cycles in multipartite tournaments (Q1338323)

An \(n\)-partite tournament is an orientation of a complete \(n\)-partite graph. We show that if \(D\) is a strongly connected \(n\)-partite \((n\geq 3)\) tournament, then every partite set of \(D\) has at least one vertex, lying on an \(m\)-cycle for all \(m\in \{3,4,\dots,n\}\). This result extends a theorem of \textit{J. A. Bondy} [J. Lond. Math. Soc., II. Ser. 14, 277-282 (1976; Zbl 0344.05124)] that any strongly connected \(n\)-partite tournament \((n\geq 3)\) contains a \(k\)-cycle for all \(k\) satisfying \(3\leq k\leq n\). Furthermore, it includes the well-known theorem of \textit{J. W. Moon} [Can. Math. Bull. 9, 297-301 (1966; Zbl 0141.412)] that every strong tournament is vertex pancyclic.