Disproof of the Odd Hadwiger Conjecture

We prove that there exist graphs which do not contain $K_t$ as an odd minor and whose chromatic number is at least $(\frac{3}{2}-o(1))t$. This disproves, in a strong form, the odd Hadwiger conjecture of Gerards and Seymour from 1993.