Zihan Tan gave a talk on an improved bound for the grid minor theorem of Robertson and Seymour at the Virtual Discrete Math Colloquium

On September 24, 2020, Zihan Tan from University of Chicago gave an online talk about his recent work with Julia Chuzhoy on an improved bound for the grid minor theorem of Robertson and Seymour. They prove that every graph with no $g\times g$ grid minor has tree-width at most $O(g^9\mathrm{poly}\log (g))$. The title of his talk was “Towards Tight(er) Bounds for the Excluded Grid Theorem“.