Asymptotic Structure of Graphs with the Minimum Number of Triangles
Combinatorics
2016-05-11 v2
Abstract
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.
Cite
@article{arxiv.1204.2846,
title = {Asymptotic Structure of Graphs with the Minimum Number of Triangles},
author = {Oleg Pikhurko and Alexander Razborov},
journal= {arXiv preprint arXiv:1204.2846},
year = {2016}
}
Comments
22 pages; 2 figures