### Chromatic Number of the Plane is at least 5

The problem From the usual Euclidean plane we form the following graph: the points of the plane are the vertices of our graph, and two vertices are connected by an edge if they are exactly unit distance apart. The so-called Hadwiger-Nelson problem is to compute the chromatic number of this graph, i.e., the least amount … Continue reading "Chromatic Number of the Plane is at least 5"

## Recent Comments