Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (Q4982284)

From MaRDI portal
Revision as of 21:00, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6418970
Language Label Description Also known as
English
Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
scientific article; zbMATH DE number 6418970

    Statements

    Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (English)
    0 references
    0 references
    0 references
    24 March 2015
    0 references
    universality
    0 references
    tournaments
    0 references
    cliques
    0 references
    anticliques
    0 references
    Erdős-Hajnal conjecture
    0 references

    Identifiers