Skip to content

Erdős problem 508

This upper bound for the chromatic number of the plane was observed by John R. Isbell. His approach was dividing the plane into hexagons of uniform size and coloring them with a repeating pattern. A proof can probably be found in:

Sources

Browse retained paths and inspect the exact material available for this Problem.

5 retained statements2415f78e850a

Open selected source

FormalConjectures/ErdosProblems/

508.lean

Retained formal statement5 of 5

The Hadwiger–Nelson problem asks: How many colors are required to color the plane such that no two points at distance 1 from each other have the same color?

FormalConjectures/ErdosProblems/508.leanErdos508.HadwigerNelsonProblem1 lineExact file
(SimpleGraph.UnitDistancePlaneGraph Set.univ).chromaticNumber = sorry
OpenStatement only, no proof

Search problems.science

Find a Problem, Result, source, or page