Hadwiger's ConjectureOpen Problem
Hadwiger's conjecture (1943) asserts that for every integer , every graph with no minor is -colourable. It is a far-reaching strengthening of the four-colour theorem, and it is widely described as one of the central open problems of graph theory (Bollobás, Catlin and Erdős called it "one of the deepest unsolved problems in graph theory"). The…