de Grey Graph


De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the chromatic number of the plane) is at least 5. While de Grey's original graph contained 20425 vertices, he was able to reduce this number (after a correction) to the 1581-vertex graph illustrated above (de Grey 2018), referred to in this work as the de Grey graph.

A few days after the original preprint was published, Mixon (2018) constructed a similar 1585-vertex graph, the removal of 8 vertices from which led to an even smaller 1577-vertex graph. This work terms these two graphs the Mixon graphs.

Smaller unit-distance graphs with chromatic number 5, here called the Heule graphs and Parts graphs, were computationally derived from the de Grey graph by Marijn Heule and Jaan Parts between 2018 and 2020. As of 2022, the smallest of these is the 509-vertex Parts graph (Parts 2020).

The de Grey graph is implemented in the Wolfram Language as GraphData["DeGreyGraph"].

See also

Golomb Graph, Hadwiger-Nelson Problem, Heule Graphs, Mixon Graphs, Moser Spindle, Parts Graphs, Unit-Distance Graph

Explore with Wolfram|Alpha


de Grey, A. D. N. J. "The Chromatic Number of the Plane Is at Least 5." Geombinatorics 28, No. 1, 18-31, 2018.Heule, M. J. H. "Computing Small Unit-Distance Graphs with Chromatic Number 5." Geombinatorics 28, 32-50, 2018.Lamb, E. "Decades-Old Graph Problem Yields to Amateur Mathematician." Quanta Mag. Apr. 17, 2018., D. G. "The Chromatic Number of the Plane Is at Least 5."Apr. 10, 2018., D. G. "Polymath16, First Thread: Simplifying De Grey's Graph." 14 Apr 2018., J. "Graph Minimization, Focusing on the Example of 5-Chromatic Unit-Distance Graphs in the Plane." Geombinatorics 29, No. 4, 137-166, 2020.PolyMath. "Hadwiger-Nelson Problem."

Cite this as:

Weisstein, Eric W. "de Grey Graph." From MathWorld--A Wolfram Web Resource.

Subject classifications