A counterexample to Hadwiger's conjecture
There are finite nonempty simple graphs of arbitrarily large order for which , disproving Hadwiger's conjecture and its fractional-coloring weakening .
The deduction from Theorem 1.1 and Proposition 3.5 to Corollary 1.2 is elementary and verified.
“There are finite nonempty simple graphs G of arbitrarily large order m for which h(G) < 26m/75 + 2/3 < m/2 <= \chi_f(G) <= \chi(G). Thus Hadwiger's conjecture and its fractional-coloring weakening \chi_f(G) <= h(G) are false.” · Show in paper