Hadwiger's conjecture (Q2822591)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6632107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hadwiger's conjecture |
scientific article; zbMATH DE number 6632107 |
Statements
30 September 2016
0 references
graph coloring
0 references
Hadwiger's conjecture
0 references
graph minors
0 references
Hadwiger's conjecture (English)
0 references
Hadwiger's conjecture, which is one of the most substantial open problems in graph theory, asserts that every non-\(k\)-colorable graph contains the complete graph \(K_k\) as a minor. The conjecture is known to be true for \(k\leq 6\) and open for the remaining values of \(k\). The author surveys known results on the conjecture and its variants.NEWLINENEWLINEFor the entire collection see [Zbl 1317.05004].
0 references
0.9109424948692322
0 references
0.8730644583702087
0 references
0.8661629557609558
0 references
