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 that is not a countable union of triangle-free graphs can consistently exist.

---