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

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:25, 5 March 2024

scientific article
Language Label Description Also known as
English
Indecomposable tournaments and their indecomposable subtournaments on 5 vertices
scientific article

    Statements

    Indecomposable tournaments and their indecomposable subtournaments on 5 vertices (English)
    0 references
    0 references
    0 references
    11 January 2007
    0 references
    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\).
    0 references
    critical tournaments
    0 references

    Identifiers