The plane is not five-colourable (Hadwiger–Nelson)
About this app
How many colours does the plane need so that points at distance 1 never share a colour? Isbell's hexagons show that 7 suffice at the right size. A unit circle marks every same-coloured pair at distance 1; stripes, squares and 5-colour attempts visibly fail, and the Moser spindle and Golomb graph sit on the plane as unit-distance graphs. Result from the AI preprint catalogue openai/math (family 158, Lean-formalised): 5 colours never suffice, so the answer is 6 or 7.
The Hadwiger–Nelson problem
How many colours do you need to colour every point of the plane so that two points exactly 1 apart never share a colour? This number is the chromatic number of the plane, χ(ℝ²). Since 1950 it has been known that 7 colours suffice, using Isbell’s hexagons of the right size. The Moser spindle shows that 3 are not enough, and in 2018 Aubrey de Grey found a finite graph that rules out 4. An AI-generated preprint in github.com/openai/math (family 158) claims that 5 colours never suffice either, with no condition on the shape of the colour regions. That would make χ(ℝ²) equal to 6 or 7. The catalogue lists it as formalised in Lean; it is not peer-reviewed.
What the app shows
The plane is coloured from presets: hexagons with 7 colours, squares with 9, plus 5-colour attempts from hexagons, stripes or random patches and a 4-colour attempt from squares. A unit compass marks every same-coloured pair at distance 1, and a check panel counts the conflicts. With the brush you can paint your own colouring. The Moser spindle and the Golomb graph can be slid across the colouring as unit-distance graphs. A bounds panel puts the known results in order.
Try it yourself
With Isbell’s hexagons, change the side length a: between about 0.378 and 0.5 there are no conflicts, outside that range pairs light up. Then pick a 5-colour attempt and hunt for same-coloured pairs with the unit compass. No sample can show that every possible 5-colouring fails; the proof is analytic and does not produce a finite graph that rules out five colours.
Frequently asked questions
- What is the Hadwiger–Nelson problem?
- The Hadwiger–Nelson problem asks for the smallest number of colours needed to colour the plane so that no two points exactly 1 apart have the same colour. That number is called the chromatic number of the plane. Unlike the four colour theorem it is not about maps but about distances between arbitrary points.
- Why are 7 colours enough for the plane?
- Tile the plane with regular hexagons in 7 colours so that hexagons of the same colour are far enough apart. With a suitable side length, roughly between 0.378 and 0.5, each hexagon is narrower than 1 and same-coloured hexagons are more than 1 apart. Then two points at distance 1 never share a colour.
- What is the chromatic number of the plane?
- For a long time it was only known to lie between 5 and 7, after de Grey ruled out 4 in 2018. An AI-generated preprint in github.com/openai/math (family 158) claims that 5 colours never suffice, so 6 or 7 are needed. The catalogue lists the result as formalised in Lean, but it has not yet been peer-reviewed, and whether the answer is 6 or 7 remains open.
- What can I try out in this app?
- You choose a colouring preset or paint your own and use the unit compass to find same-coloured points at distance 1. A counter reports the conflicts. The Moser spindle and Golomb graph can be slid over the colouring, and a panel shows the known bounds.
Subject: Open problems, solved by AI
More from Open problems, solved by AI
- Anderson localisation: 2D vs. 3D (3D)
- Barker sequences and circulant Hadamard matrices
- Barnette's conjecture: a round trip over every polyhedron (3D)
- Birkhoff billiards: only the ellipse has no gaps
- Cardy's formula — percolation in a random tiling
- Double-dimer loops and CLE₄
- Triangular billiards — irrational angles mix (3D)
- Triangular lattice — universal optimality
A VisuApp by heyprof: interactive, free in your browser, no sign-up. What is a VisuApp? · All apps