Recent Progress on Hadwiger's Conjecture
Abstract: A far-reaching generalization of the four color theorem, Hadwiger's conjecture from 1943 says that for all $t\geq1$, every graph with chromatic number at least $t$ contains a subgraph which can be contracted to a complete graph on $t$ vertices. This talk aims to survey recent progress on this wide-open conjecture.
Speaker: Tung Nguyen is a third-year PhD student in the Program in Applied and Computational Mathematics at Princeton University, working with Paul Seymour. Before Princeton, he earned a Bachelor of Science (with Honors) in Mathematical Sciences from KAIST, where his thesis advisor was Sang-il Oum. Tung is interested in discrete mathematics, mostly structural and extremal problems in graph theory.