Disproof of the List Hadwiger Conjecture

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\ge 1$.

References in corpus (1)

• Thomassen's Choosability Argument Revisited

Cited by in corpus (3)

• Defective colouring of graphs excluding a subgraph or minor
• Maximum 4-degenerate subgraph of a planar graph
• A Graph Minor Perspective to Multicast Network Coding