Disproof of the List Hadwiger Conjecture

János Barát, Gwenaël Joret, David R. Wood

Source record

Source: Crossref

Published: Dec 12, 2011

DOI: 10.37236/719

Open original source ↗

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

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.