Disproof of the List Hadwiger Conjecture

作者：Barat Janos^*; Joret Gwenael; Wood David R

来源：Electronic Journal of Combinatorics, 2011, 18(1): P232.

The List Hadwiger Conjecture asserts that every K-t-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.

• 出版日期2011-12-12