\(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament (Q6133660)

A digraph \(D\) is arc pancyclic if every arc of \(D\) lies in an \(t\)-cycle for all \(t\) between 3 and \(|V (D)|\). \textit{B. Alspach}'s theorem [Can. Math. Bull. 10, 283--286 (1967; Zbl 0148.43602)] states that every regular tournament is arc pancyclic. It is known that there exist regular multipartite tournaments that are not arc pancyclic. The main goal of the paper under review is to provide an extension of Alspach's theorem to regular multipartite tournaments, by proving that, if \(T\) is a regular \(c\)-partite tournament with partite sets \(V_1,\,V_2,\,\dots,\,V_c\) with \(c\geq 3\), then \(T\) is quasi\(_{\mathrm{ps}}\)-pancyclic, that is, if \([V_i,\, V_j]\neq\emptyset\), then there is a \((V_j,\, V_i)\)-path in \(T\) that transverses exactly \(k\) partite sets for each \(k \in \{4,\dots,\,c\}\). Moreover, the authors also provide a counterexample to a Guo conjecture thus proving that the result presented here is in a certain sense not improvable.