Claims

../

2003_07_16_keevash_sudakov: Theorem 1.1 of Keevash and Sudakov (J. Combin. Theory Ser. B 2004) gives the maximum number of edges in no monochromatic triangle for every n; it is ⌊n²/4⌋ ≤ n²/4 for every n ≥ 7, proving the bound for large n.

---