THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE

<jats:p>What is the minimum number of triangles in a graph of given order and size? Motivated by earlier results of Mantel and Turán, Rademacher solved the first nontrivial case of this problem in 1941. The problem was revived by Erdős in 1955; it is now known as the Erdős–Rademacher problem. After attracting much attention, it was solved asymptotically in a major breakthrough by Razborov in 2008. In this paper, we provide an exact solution for all large graphs whose edge density is bounded away from <jats:inline-formula>
<jats:alternatives>
<jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" mimetype="image" xlink:href="S2050508620000074_inline1.png" />
<jats:tex-math>$1$</jats:tex-math>
</jats:alternatives>
</jats:inline-formula>, which in this range confirms a conjecture of Lovász and Simonovits from 1975. Furthermore, we give a description of the extremal graphs.</jats:p>