Hadwiger–Nelson problemHadwiger–Nelson problem
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
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.
Excerpt from the Wikipedia article “Hadwiger–Nelson problem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: David Eppstein, Public domain, via Wikimedia Commons.
Open free boosters and add Hadwiger–Nelson problem to your collection.
Play for free




