Asymptotic Structure of Graphs with the Minimum Number of Triangles

OLEG PIKHURKO, ALEXANDER RAZBOROV

Source record

Source: Crossref

Published: May 4, 2016

DOI: 10.1017/s0963548316000110

Open original source ↗

Source 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.