A small 6-chromatic two-distance graph in the plane
Jaan Parts·2020-10-24·via math.CO updates on arXiv.org
We give a new, simple proof for the lower bound of the chromatic number of the Euclidean plane with two forbidden distances, based on a graph with only 16 vertices.