Disproof of the List Hadwiger Conjecture

@article{Bart2011DisproofOT,
  title={Disproof of the List Hadwiger Conjecture},
  author={J{\'a}nos Bar{\'a}t and Gwena{\"e}l Joret and David R. Wood},
  journal={Electr. J. Comb.},
  year={2011},
  volume={18}
}
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 4tchoosable for every integer t ≥ 1.