Hadwiger–Nelson Problem: How Many Colors Does It Take?

Quick answer: The Hadwiger–Nelson problem asks for the fewest colors needed to color every point of the plane so that no two points exactly 1 unit apart share a color. This number, the chromatic number of the plane, is at least 5 (Aubrey de Grey, 2018) and at most 7 (a hexagon tiling). On October 6, 2026, OpenAI released a preprint, with a Lean formalization, claiming that 5 colors are not enough, which would make the answer 6 or 7. No journal publication has been identified yet.

Take a paint box and try to color the whole plane, every single point, following one rule: two points exactly 1 unit apart must get different colors. How many colors do you need? This innocent puzzle, posed in 1950 by Edward Nelson, has resisted the best mathematicians ever since, and it moved twice in the last decade.

The Rule and the Bounds

The answer, written \(\chi(\mathbb{R}^2)\), is called the chromatic number of the plane. Here is where it stands:

BoundValueWho and whenStatus
Lower4Known by 1950 (Nelson); Moser spindle (1961) is a small 7-point witnessClassic
Lower5Aubrey de Grey (2018), 1,581-point graphAccepted, computer-checked
Lower6OpenAI preprint (dated September 23, released October 6, 2026)Claimed; preprint with Lean formalization
Upper7John Isbell (1950), hexagon tilingClassic

Why 7 Colors Always Work

Tile the plane with regular hexagons of diameter slightly less than 1, and color them with 7 colors in a repeating pattern so that same-colored hexagons are far apart. Two points in the same hexagon are less than 1 apart, and two points in different hexagons of the same color are more than 1 apart. So no two points at distance exactly 1 share a color.

Why 2 Colors Fail: The Equilateral Triangle

An equilateral triangle with side 1 has three points all 1 apart, so they need 3 different colors. That rules out 2 colors. To prove more colors are needed, mathematicians build unit-distance graphs: points in the plane, with lines joining pairs exactly 1 apart. If a graph cannot be colored with \(k\) colors, neither can the plane.

Why 4 Colors Fail: The Moser Spindle

The Moser spindle shows that 3 colors fail. It has just 7 points. Join two unit rhombuses (each made of two equilateral triangles, including the short diagonal) at a shared point, and rotate one so that their far tips are exactly 1 apart. In a 3-coloring, each rhombus forces its far tip to match the shared point’s color, so both tips get the same color, yet they are 1 apart. No 3-coloring works, so the plane needs at least 4 colors.

2018: An Amateur Proves 5

For nearly 60 years the lower bound stuck at 4. In April 2018, Aubrey de Grey, best known as a biologist studying aging, built a unit-distance graph with 1,581 points that cannot be 4-colored, checked by computer. The online Polymath16 project, launched by Dustin Mixon and others, then shrank such graphs; the smallest known 5-chromatic unit-distance graph has 509 points and 2,442 edges (Jaan Parts, 2020).

2026: The Claim That 5 Is Not Enough

On October 6, 2026, OpenAI released a preprint, dated September 23 and produced with an unreleased internal model, titled “The Euclidean plane is not five-colorable.” It claims \(6 \le \chi(\mathbb{R}^2) \le 7\) for arbitrary colorings, with no measurability assumption. The method is not a new finite graph: it shows that a 5-coloring would yield a specially defined “weak measurable” coloring, then rules those out with ergodic-theory techniques, ending with the Moser spindle.

OpenAI also published a Lean formalization covering the lower bound and the 7-color construction. Gil Kalai noted that such releases still need to be examined and digested by the mathematical community, and the sources checked for this update did not identify a journal publication. No explicit 6-chromatic unit-distance graph is known. Separately, an October 2026 paper by Ewan Davies proved that measurable and unrestricted chromatic numbers agree in dimensions 4 and up; it does not itself prove the plane bound. As of November 2026, treat 6 as a strong claim, not a settled theorem.

Common Misconceptions

“This is the four color theorem.” No. The four color theorem is about maps where neighboring regions differ. Here every point is colored and the rule is about distance 1.

“The answer is 7 because the hexagons work.” The hexagons only show 7 is enough. Whether 6 colors could also work is still open.

Watch: The Hadwiger–Nelson Problem in Video

If you learn better by watching, these videos are worth your time.

A Colorful Unsolved Problem – Numberphile (Numberphile). The problem, the Moser spindle and de Grey’s 2018 breakthrough.
Hadwiger-Nelson problem | Why Tiles? (1/2) (XorUnison). A visual look at tilings and the 7-color upper bound (note: made before the 2026 claim).

Check Your Understanding

Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.

Answer each question and press Submit to see your result right away.

1. What does the Hadwiger–Nelson problem forbid?
Found a bug? Let us know!
2. Why do 7 colors always suffice?
Found a bug? Let us know!
3. How many points does the Moser spindle have?
Found a bug? Let us know!
4. Who proved that at least 5 colors are needed?
Found a bug? Let us know!
5. What did OpenAI’s 2026 preprint claim?
Found a bug? Let us know!

Frequently Asked Questions

What is the chromatic number of the plane?

The fewest colors needed to color all points of the plane so that no two points exactly 1 unit apart share a color. It is known to be between 5 and 7.

Has the Hadwiger–Nelson problem been solved?

No. The established range is 5 to 7. An October 2026 OpenAI preprint with a Lean formalization claims 5 colors are not enough, which would narrow it to 6 or 7; no journal publication has been identified yet.

Why is the answer at most 7?

A tiling by regular hexagons of diameter slightly less than 1, colored with 7 colors in a repeating pattern, keeps same-colored points either closer than 1 or farther than 1.

Who is Aubrey de Grey?

A researcher best known for work on aging who, as an amateur mathematician, proved in 2018 that the plane needs at least 5 colors.

Keep Exploring

Sources and Further Reading

Related to This Article

What people say about "Hadwiger–Nelson Problem: How Many Colors Does It Take? - Effortless Math"?

No one replied yet.

Leave a Reply