Counterexamples to Hadwiger's conjectureResearch Paper
Hadwiger's conjecture (Hadwiger, 1943) asserts that every finite nonempty simple graph satisfies : the largest order of a complete minor is at least the chromatic number. It places planar coloring in a minor-theoretic setting. The -minor-free case was proved by Hadwiger and Dirac; Wagner's structure theorem makes the -minor-free case…