On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem (Q2510770): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3348936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the Turán number \(t_3(n,4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of triangles in a graph / 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: A class of constructions for Turan's (3,4)-problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3669452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of dense graph sequences / 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: The minimum size of 3-graphs without a 4-set spanning no or exactly three edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / 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: On 3-Hypergraphs with Forbidden 4-Vertex Configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: What we know and what we do not know about Turán numbers / rank
 
Normal rank

Revision as of 19:42, 8 July 2024

scientific article
Language Label Description Also known as
English
On the Fon-Der-Flaass interpretation of extremal examples for Turán's \((3,4)\)-problem
scientific article

    Statements

    Identifiers