Disproof of the Odd Hadwiger Conjecture
Abstract
We prove that there exist graphs which do not contain Kt as an odd minor and whose chromatic number is at least ( 32-o(1))t. This disproves, in a strong form, the odd Hadwiger conjecture of Gerards and Seymour from 1993.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.