Grid Minor Theorem for Planar Graphs
Discrete Structures and Algorithms (Reading Group): Graph Minors
by David Wood
Abstract: A fundamental result in graph minor theory states that every graph with large treewidth contains a large grid minor. As preparation for proving that result, we will prove it for planar graphs. It would be good to read the start of Diestel's chapter on treewidth as preparation.