Papalocal
Loading…
Papalocal · Things
Work

Hadwiger–Nelson problem

Hadwiger–Nelson problem is a mathematical problem.

All 3 facts, and where they come from

Facts

3 facts · 0 confirmed by two sources · 0 cited · 3 from one source

What it is
mathematical problem One source
Named after
Hugo Hadwiger One source
Edward Nelson One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 17, 2026 · revision 2568706589
Described as
mathematical problem
What it is
mathematical problem
Named after
Hugo Hadwiger; Edward Nelson
Wikipedias with a page
13

Wikidata item Q1383936 (wikidata.org/wiki/Q1383936), public domain (CC0). Copied 2026-11-17.

What Wikipedia says · copied November 17, 2026 · revision 1379095548

In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks for the minimum number of colors required to color the plane such that no two points at distance 1 from each other have the same color. The answer is unknown, but has been narrowed down to one of the numbers 5, 6 or 7. The correct value may depend on the choice of axioms for set theory.

From the Wikipedia article “Hadwiger–Nelson problem” (en.wikipedia.org/wiki/Hadwiger–Nelson_problem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it