%0 Journal Article
%T Disproof of the List Hadwiger Conjecture
%A J¨˘nos Bar¨˘t
%A Gwena£żl Joret
%A David R. Wood
%J Computer Science
%D 2011
%I arXiv
%X 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$.
%U http://arxiv.org/abs/1110.2272v1