An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic
Let \(T\) be an \(s\)-strong tournament with \(n\) vertices where \(s\geq 3\). The authors show that \(T\) contains at least \(s+1\) vertices \(v\) such that each arc leading away from \(v\) belongs to cycles of lengths \(4,5,\dots, n\).
scientific article; zbMATH DE number 5082764