Cycles through a given arc and certain partite sets in almost regular multipartite tournaments (Q1827790)

A digraph \(D\) is almost regular if there exists a positive integer \(k\) such that the in-degree and the out-degree of every vertex in \(D\) belongs to \(\{k,k+1\}\). If all in-degrees and out-degrees are equal to \(k\), then \(D\) is said to be regular. A \(c\)-partite tournament is an orientation of a complete \(c\)-partite graph. \textit{Y. Guo} and \textit{J. H. Kwak} [Discrete Appl. Math. 120, No. 1--3, 109--116 (2002; Zbl 1004.05035)] proved that if \(D\) is a regular \(c\)-partite tournament with \(c\geq 4\), then every arc in \(D\) is in a directed cycle which contains vertices from exactly \(m\) partite sets for all \(m\), \(4\leq m\leq c\). In this paper this result is generalized to almost regular \(c\)-partite tournaments with at least two vertices in each partite set.