The Hadwiger Problem
|The Hadwiger Problem|
|Cubes within cubes within cubes... (+1 Trust)|
Summary[edit | edit source]
Notes[edit | edit source]
In real life, the Hadwiger-Nelson problem is a part of geometric graph theory. It asks for the minimum number of colors required to color a mathematical plane such that no two points at distance 1 from each other have the same color.
|This article is a stub. You can help Universal Paperclips Wiki by .|
This article is a stub. You can help Universal Paperclips Wiki by .