arXiv Analytics

Sign in

arXiv:1204.2846 [math.CO]AbstractReferencesReviewsResources

Asymptotic Structure of Graphs with the Minimum Number of Triangles

Oleg Pikhurko, Alexander Razborov

Published 2012-04-12, updated 2014-09-24Version 2

We consider the problem of minimizing the number of triangles in a graph of given order and size and describe the asymptotic structure of extremal graphs. This is achieved by characterizing the set of flag algebra homomorphisms that minimize the triangle density.

Comments: 22 pages; 2 figures
Categories: math.CO
Subjects: 05C35
Related articles: Most relevant | Search more
arXiv:1501.03129 [math.CO] (Published 2015-01-13)
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
arXiv:1111.7029 [math.CO] (Published 2011-11-30)
Extremal graphs for clique-paths
arXiv:1201.4912 [math.CO] (Published 2012-01-24)
Extremal Graphs Without 4-Cycles

Links

Toolbox