Forcing large transitive subtournaments (Q2343283): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Testing subgraphs in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournaments and colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5688999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Minors I: A Short Proof of the Path-width Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Voting Problem / rank
 
Normal rank

Revision as of 00:40, 10 July 2024

scientific article
Language Label Description Also known as
English
Forcing large transitive subtournaments
scientific article

    Statements

    Forcing large transitive subtournaments (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2015
    0 references
    Erdős-Hajnal conjecture
    0 references
    regularity lemma
    0 references
    tournaments
    0 references
    substitution operations
    0 references

    Identifiers