Algebra and Combinatorics Seminar

Date: March 26, 2021

Time: 3:00PM - 4:00PM

Location: Zoom

Speaker: Zixia Song, University of Central Florida

Title: Hadwiger’s Conjecture

Abstract: Hadwiger's conjecture from 1943 states that for every integer t, every graph either can be t-colored or has a subgraph that can be contracted to the complete graph on t+1 vertices. This is a far-reaching generalization of the Four-Color Theorem and perhaps the most famous conjecture in graph theory. In this talk we will survey the history of Hadwiger's conjecture and the main ideas of recent results.