Disproof of the List Hadwiger Conjecture

Janos Barat, Gwenael Joret, David Wood

Research output: Contribution to journalArticleResearchpeer-review

10 Citations (Scopus)


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 4t-choosable for every integer t>1
Original languageEnglish
Pages (from-to)1 - 7
Number of pages7
JournalThe Electronic Journal of Combinatorics
Issue number1
Publication statusPublished - 2011

Cite this