Hadwiger's Graph Colouring Conjecture

Grant number: DP120101081 | Funding period: 2012 - 2015



Networks are a pervasive part of modern life. This project seeks to answer one of the deepest unsolved problems in the mathematics of networks, namely Hadwiger's Conjecture. This 65-year old problem suggests a sweeping generalisation of the famous map four-colour theorem, and is at the frontier of research in pure mathematics.

University of Melbourne Researchers