Disproof of the List Hadwiger Conjecture

  • János Barát
  • Gwenaël Joret
  • David R. Wood
DOI: https://doi.org/10.37236/719

Abstract

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$.

Published
2011-12-12
How to Cite
Barát, J., Joret, G., & Wood, D. R. (2011). Disproof of the List Hadwiger Conjecture. The Electronic Journal of Combinatorics, 18(1), P232. https://doi.org/10.37236/719
Issue
Volume 18, Issue 1 (2011)
Article Number
P232