Vertex 6-pancyclic in-tournaments (Q1877667): Difference between revisions

An in-tournament is an oriented graph in which the in-neighbourhood of every vertex induces a tournament. The main result in this paper is that if \(D\) is a strong in-tournament of order \(n\geq 6\) \((n\neq 14,15,16)\) and minimum degree greater than \((16n-39)/73\), then every vertex of \(D\) belongs to a cycle of each length between 6 and \(n\), inclusive. This result is a special case of a conjecture of \textit{M. Tewes} and \textit{L. Volkmann} [J. Graph Theory 36, No. 2, 84--104 (2001; Zbl 0971.05052)].