Asymptotic Structure of Graphs with the Minimum Number of Triangles
classification
🧮 math.CO
keywords
asymptoticgraphsnumberstructuretrianglesachievedalgebracharacterizing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.