Pancyclic in-tournaments (Q5936029)

Suppose \(k\) and \(n\) are integers such that \(3\leq k\leq n\). If \(3\leq k\leq\sqrt{n+1}\), let \(h(k)= (n+ 1)/k+ (k- 4)/2\) if \(k\) is even and let \(h(k)= (n+ 2)/k+ (k-5)/2\) if \(k\) is odd. If \(\sqrt{n+1}< k\leq n\), let \(h(k)= 3n/(2k+ 2)- 1/2\). The author shows that if \(D\) is an in-tournament with \(n\) vertices whose minimum in-degree is at least \(h(k)\) then \(D\) contains a \(t\)-cycle for every \(t\) such that \(k\leq t\leq n\). The case when \(k=3\) was considered earlier by \textit{M. Tewes} and \textit{L. Volkmann} [Austral. J. Comb. 18, 293-301 (1998; Zbl 0914.05034)].