Recent Progress Towards Hadwiger’s Conjecture

Explore the latest advancements in graph theory with this 45-minute lecture by Sergey Norin, presented at the International Mathematical Union. Delve into Hadwiger's conjecture, a fundamental problem in graph theory that generalizes the Four Color Theorem. Learn about the ideas behind recent progress towards this conjecture, including the first asymptotic improvement since the 1980s on the number of colors sufficient to color graphs with no K_{t} minor. Gain insights into the historical context of the conjecture, dating back to 1943, and its significance in the field. Enhance your understanding of graph coloring, minors, and related concepts through this comprehensive overview of cutting-edge research.