Claims

../

1970_01_01_folkman: Folkman's Theorem 1 (SIAM J. Appl. Math. 1970): for all k_1, k_2 at least 2 some graph with clique number max(k_1, k_2) has a monochromatic clique of the matching size in every two-coloring of its edges; the case k = 2, refereed.

1976_06_01_nesetril_rodl: The theorem of Nešetřil and Rödl (J. Combin. Theory Ser. B 1976) that for every finite graph G and number c of colors some graph with the clique number of G forces a monochromatic G in every c-edge-coloring; refereed, not held.

---