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