Pancyclic orderings of in-tournaments (Q1613377): Difference between revisions

Let \(D\) denote a strong in-tournament with \(n\geq 3\) vertices, such that each vertex has at least \((3n- 3)/8\) arcs directed towards it. The author shows, among other things, that there is an ordering of the vertices such that the digraph determined by the first \(t\) vertices in this ordering is Hamiltonian, for \(t= 3,4,\dots,n\). The lower bound is sharp.