Claims

../

1989_01_01_shelah: Shelah (Lecture Notes in Math. 1401, 1989) proved by forcing, from a measurable cardinal or a weaker hypothesis, that a K_4-free graph forcing a monochromatic triangle in every countable edge coloring can consistently exist.

1993_03_01_komjath_shelah: Komjáth and Shelah (Acta Math. Hungar., 1993) proved, from a class of measurable cardinals, the consistency of: for every graph Y and cardinal mu some graph X has X -> (Y)^2_mu and omits every complete graph Y omits.

---