Indecomposable tournaments and their indecomposable subtournaments on 5 vertices (Q858914): Difference between revisions

A tournament is critically indecomposable if, removing any of its vertices, the remaining tournament is no longer indecomposable. \textit{J. H. Schmerl} and \textit{W. T. Trotter} [Discrete Math. 113, No. 1--3, 191--205 (1993; Zbl 0776.06002)] proved that every critical tournament with at least five vertices must be isomorphic to one of the three fundamental types \(T_{2n+1}\), \(U_{2n+1}\) or \(V_{2n+1}\) (where \(n\geq 2\)). The main result of this paper states that if an indecomposable tournament with at least 6 vertices is not isomorphic to any of the tournaments \(T_{2n+1}\) then, if it contains an isomorphic copy of \(T_5\), it must also contain isomorphic copies of \(U_5\) and \(V_5\).