Cycle-pancyclism in tournaments. III
Let \(f(n,k)\) denote the largest integer \(h\) such that for any \(n\)-cycle of any strong tournament \(T_n\), there exists some \(k\)-cycle that has at least \(h\) arcs in common with the \(n\)-cycle. The authors have investigated the values of \(f(n,k)\) in two earlier papers [Graphs Comb. 11, 233-243 (1995; Zbl 0833.05039); and 12, No. 1, 9-16 (1996; Zbl 0844.05047)]. They complete their description of \(f(n,k)\) in the present paper by showing that \(f(n,k)= k-4\) if and only if \(n\leq 2k-5\) and \(5<k<n\).
scientific article; zbMATH DE number 989829