On cycles in regular 3-partite tournaments (Q5920598)

In 1991, J.~Wang conjectured that every arc of a regular 3-partite tournament \(D\) is contained in directed cycles of all lengths \(3,6,9,\dots ,| V(D)| \), where \(V(D)\) is the vertex set of \(D\). As shown by \textit{L.~Volkmann} [J.~Comb. Math. Comb. Comput. 51, 203--204 (2004; Zbl 1075.05042)], this conjecture is not valid, because for each integer \(t\) with \(3\leq t\leq | V(D)| \), there exists an infinite family of regular 3-partite tournaments \(D\) such that at least one arc of \(D\) is not contained in a directed cycle of length \(t\). In the present paper, it is shown that every regular 3-partite tournament with at least nine vertices is contained in a directed cycle of length \(m\), \(m+1\), or \(m+2\) for \(3\leq m\leq 5\). It is conjectured that every arc of a regular 3-partite tournament is contained in a directed cycle of length \(m\), \(m+1\), or \(m+2\) for each \(m\in\{3,4,\dots ,| V(D)| -2\}\). It is known that every regular 3-partite tournament \(D\) with at least six vertices contains directed cycles of lengths \(3\), \(| V(D)| -3\), and \(V(D)\). It is shown that every regular 3-partite tournament with at least six vertices also has directed cycle of length \(6\). The paper conjectures that each such 3-partite tournament contains cycles of all lengths \(3,6,9,\dots ,| V(D)| \).