Universality of Graphs with Few Triangles and Anti-Triangles (Q5366905): 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: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey-type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs / 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: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Disproof of a Conjecture of Erdős in Ramsey Theory / rank
 
Normal rank

Latest revision as of 12:16, 14 July 2024

scientific article; zbMATH DE number 6788911
Language Label Description Also known as
English
Universality of Graphs with Few Triangles and Anti-Triangles
scientific article; zbMATH DE number 6788911

    Statements

    Identifiers