Claims

../

2025_10_20_ma_tang: Theorem 2.1 of Ma and Tang's note (October 2025) gives, for large n, graphs on n vertices with more than n²/4 edges in which every triangle has at most (2 − √(5/2) + o(1))n ≈ 0.4189n vertices joined to two of its vertices.

---