A small 6-chromatic two-distance graph in the plane
arXiv:2010.12656
Abstract
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.
arXiv:2010.12656
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.