Hadwiger–Nelson problem

Summary

Hadwiger–Nelson problem is a mathematical problem^[1]. It draws 96 Wikipedia views per month (mathematical_problem category, ranking #32 of 128).^[2]

Key Facts

• Hadwiger–Nelson problem's instance of is recorded as mathematical problem^[3].
• Hugo Hadwiger is named after Hadwiger–Nelson problem^[4].
• Edward Nelson is named after Hadwiger–Nelson problem^[5].
• Paul Erdős is named after Hadwiger–Nelson problem^[6].
• Hadwiger–Nelson problem's Freebase ID is recorded as /m/08tk97^[7].
• Hadwiger–Nelson problem's main subject is recorded as chromatic number^[8].
• Hadwiger–Nelson problem's studied by is recorded as discrete geometry^[9].
• Hadwiger–Nelson problem's studied by is recorded as graph theory^[10].
• Hadwiger–Nelson problem's MathWorld ID is recorded as Hadwiger-NelsonProblem^[11].
• Hadwiger–Nelson problem's maintained by WikiProject is recorded as WikiProject Mathematics^[12].
• Hadwiger–Nelson problem's Microsoft Academic ID is recorded as 2779701216^[13].

Why It Matters

Hadwiger–Nelson problem draws 96 Wikipedia views per month (mathematical_problem category, ranking #32 of 128).^[2] It has Wikipedia articles in 11 language editions, a strong signal of global cultural recognition.^[14] It is known by 12 alternative names across languages and contexts.^[15]