Hadwiger conjecture
conjecture that all graphs requiring k or more colors contain a k-vertex complete minor
Facts
6 properties- Instance of
- conjecture
- Defining formula
- \chi(G)\le h(G)[3]
- Maintained by WikiProject
- WikiProject Mathematics[5]
- Named after
- Hugo Hadwiger[2]
- Studied by
- graph theory[4]
🏷️ Also known as
en Hadwiger conjecture
de Hadwigers Vermutung
de Hadwiger-Vermutung
de Vermutung von Hadwiger
fr Conjecture de Hadwiger
fr Conjecture d'Hadwiger
hu Hadwiger-sejtés
ru гипотеза Хадвигера
ru гипотеза Хадвигера (теория графов)
uk гіпотеза Хадвігера
zh Hadwiger猜想
zh 哈德維格猜想 (圖論)
zh 哈德维格猜想
🔖 Identifiers · 4
- Freebase ID
- /m/05l6s0
- MathWorld ID
- HadwigerConjecture
- Microsoft Academic ID (discontinued)
- 2779541677
- Quora topic ID
- Hadwiger-Conjecture
🔗 Connections
Instance of 1
Maintained by WikiProject 1
Named after 1
Studied by 1
Press Enter · cited answer in seconds
0 sources
Summary
Hadwiger conjecture is a conjecture[1].