High Quality Content by WIKIPEDIA articles! 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 one from each other have the same color. The answer is unknown, but has been narrowed down to one of the numbers 4, 5, 6 or 7. The actual value may actually depend on the choice of axioms for set theory (Shelah

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.