Claims

../

1962_03_01_erdos: Erdős (Illinois J. Math. 1962) proves that a graph on n vertices with the Turán number plus t edges has at least t times the floor of half of n triangles whenever t is below a constant times n; refereed.

1976_01_01_lovasz_simonovits: Lovász and Simonovits prove that a graph on n vertices with the Turán number plus k edges, k below half of n, has at least k times the floor of half of n triangles; the 1976 paper and the 1983 chapter carry the proof.

1981_01_01_nikiforov_khadzhiivanov: A 1981 note in the Comptes rendus of the Bulgarian Academy that the site credits with an independent proof of the Erdős–Rademacher conjecture; the note is not held and no record of it was found.

2026_08_26_alexeev: A Lean development in Boris Alexeev's repository, first committed on 26 August 2026, proving for every n that a graph with floor(n^2/4)+t edges, t below floor(n/2), has at least t·floor(n/2) triangles; read as text only.

---