Recent progress towards Hadwiger’s conjecture

  • Sergey Norin

    Department of Mathematics and Statistics, McGill University, Montreal, QC, Canada
Recent progress towards Hadwiger’s conjecture cover
Download Chapter PDF

This book chapter is published open access.


In 1943 Hadwiger conjectured that every graph with no minor is -colorable for every . Hadwiger’s conjecture generalizes the Four Color Theorem and is among most studied problems in graph theory.

In this paper we survey the ideas behind recent progress towards this conjecture, which, in particular, allowed for the first asymptotic improvement since 1980s on the number of colors sufficient to color every graph with no minor.