A remark on cycles through an arc in strongly connected multipartite tournaments (Q2470348)

A multipartite or \(c\)-partite tournament is an orientation of a complete \(c\)-partite graph. The author proves that a strongly connected \(c\)-partite tournament with \(c \geq 3\) contains an arc that belongs to a directed cycle of length \(m\) for every \(m \in \{3,4,\ldots,c\}\). This extends results of \textit{J. A. Bondy} [J. Lond. Math. Soc. (2) 14, 277--282 (1976; Zbl 0344.05124)], \textit{A. Yeo} [J. Graph Theory 32, No. 2, 137--152 (1999; Zbl 0931.05037)], \textit{P. Camion} [C. R. Acad. Sci. Paris 249, 2151--2152 (1959; Zbl 0092.15801)], and \textit{F. Harary} and \textit{L. Moser} [Am. Math. Mon. 73, 231--246 (1966; Zbl 0142.41602)].