Disproof of the list Hadwiger conjecture (Q665753)
From MaRDI portal
!
WARNING
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 6012336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Disproof of the list Hadwiger conjecture |
scientific article; zbMATH DE number 6012336 |
Statements
Disproof of the list Hadwiger conjecture (English)
0 references
6 March 2012
0 references
Summary: The list Hadwiger Conjecture asserts that every \(K_t\)-minor-free graph is \(t\)-choosable. We disprove this conjecture by constructing a \(K_{3t+2}\)-minor-free graph that is not \(4t\)-choosable for every integer \(t \geq 1\).
0 references
choosable \(K_t\)-minor-free graph
0 references
0.8501005172729492
0 references
0.8417206406593323
0 references
0.8401755094528198
0 references
0.8343605399131775
0 references
0.824644148349762
0 references
