Hadwiger conjecture (Q1128435)
Jump to navigation
Jump to search
conjecture that all graphs requiring k or more colors contain a k-vertex complete minor
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hadwiger conjecture |
conjecture that all graphs requiring k or more colors contain a k-vertex complete minor |
Statements
Identifiers
Sitelinks
Wikipedia(6 entries)
- dewiki Hadwigers Vermutung
- enwiki Hadwiger conjecture (graph theory)
- frwiki Conjecture de Hadwiger
- huwiki Hadwiger-sejtés (gráfelmélet)
- ruwiki Гипотеза Хадвигера (теория графов)
- ukwiki Гіпотеза Хадвігера