Claims

../

1966_11_01_moon: Moon (Math. Mag. 1966): every two-coloring of K_n has [n/3] - 1 disjoint monochromatic triangles, and [n/3] when n is 2 mod 3 and at least 8; at most 4 vertices are left for n other than 5, the site's f(3) = 4; refereed.

1975_01_01_burr_erdos_spencer: Burr, Erdős and Spencer (1975), Theorem 6: for fixed k and large n, the most vertices a 2-coloring of K_n can force to be left after deleting disjoint monochromatic copies of K_k is r(k,k−1) − 1 plus (n − r(k,k−1) + 1) mod k.

---