Zihan Tan, Towards Tight(er) Bounds for the Excluded Grid Theorem


We study the Excluded Grid Theorem, a fundamental structural result in graph theory, that was proved by Robertson and Seymour in their seminal work on graph minors. The theorem states that there is a function $f$, such that for every integer $g > 0$, every graph of treewidth at least $f(g)$ contains the g×g-grid as a minor. For every