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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Indecomposability and duality of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitivity is hereditary for 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphism groups of designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorem for tournaments omitting <i>N</i><sub>5</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures / rank
 
Normal rank

Latest revision as of 11:33, 25 June 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