Difference between revisions of "Hadwiger-Nelson problem"

From Polymath1Wiki
Jump to: navigation, search
(Created page with "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 un...")
(No difference)

Revision as of 12:21, 13 April 2018

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. The bounds [math]4 \leq CNP \leq 7[/math] are classical; recently [deG2018] it was shown that [math]CNP \geq 5[/math].



Blog posts and other online forums

Code and data

Wikipedia

Bibliography

  • [deG2018] [The chromatic number of the plane is at least 5, Aubrey D.N.J. de Grey, Apr 8 2018.
  • [P1998] D. Pritikin, All unit-distance graphs of order 6197 are 6-colorable, Journal of Combinatorial Theory, Series B 73.2 (1998): 159-163.