Polymath Projects

Hadwiger-Nelson Problem

The Chromatic Number of the Plane (CNP) is the chromatic number of the graph whose vertices are elements of the plane, and two points are connected by an edge if they are a unit distance apart. The Hadwiger-Nelson problem asks to compute CNP.


Showing 1 to 17 of 17 results