Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (Q4982284): 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 18:18, 5 March 2024

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