Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal (Q4982284): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient testing of large 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: Bounds for graph regularity and removal lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Acquaintances and Strangers at any Party / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality of Graphs with Few Triangles and Anti-Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 3‐Local Profiles of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cliques in graphs of given order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Number of<i>k</i>-Cliques in Graphs with Bounded Independence Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Ramsey graphs are \(c\log n\)-universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimal Density of Triangles in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph products and monochromatic multiplicities / rank
 
Normal rank

Latest revision as of 21:00, 9 July 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