Abstract
The List Hadwiger Conjecture asserts that every Kt-minor-free graph is t-choosable. We disprove this conjecture by constructing a K3t+2-minor-free graph that is not 4t-choosable for every integer t>1
| Original language | English |
|---|---|
| Pages (from-to) | 1 - 7 |
| Number of pages | 7 |
| Journal | The Electronic Journal of Combinatorics |
| Volume | 18 |
| Issue number | 1 |
| Publication status | Published - 2011 |