Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic (Q5957756)

For a digraph \(D\), a semidegree of a vertex \(x\) is its indegree or outdegree. The minimum (maximum) semidegree of \(D\) is denoted by \(\delta (\Delta)\). \(D\) is almost regular if \(\Delta-\delta\leq 1\). It is proved that all, except possibly a finite number, almost regular \(c\)-partite tournaments are vertext pancyclic when \(c\geq 5\).