Hadwiger's graph colouring conjecture

  • Wood, David (Primary Chief Investigator (PCI))
  • Zhou, Sanming (Chief Investigator (CI))

Project: Research

Project Details

Project Description

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 4-colour theorem, and is at the frontier of research in pure mathematics.
StatusFinished
Effective start/end date1/01/1230/04/15

Funding

  • Australian Research Council (ARC): AUD286,148.97
  • University of Melbourne