Disproof of the Odd Hadwiger Conjecture
arXiv:2512.20392
Abstract
We prove that there exist graphs which do not contain as an odd minor and whose chromatic number is at least . This disproves, in a strong form, the odd Hadwiger conjecture of Gerards and Seymour from 1993.
24 pages