School Seminars and Colloquia

The Grid Minor Theorem, Part 2

Discrete Structures and Algorithms (Reading Group): Graph Minors

by Dr Gwenael Joret


Institution: Universite Libre de Bruxelles
Date: Mon 31st October 2011
Time: 11:00 AM
Location: Room 107, Richard Berry Building

Abstract: The grid minor theorem states that every graph with sufficiently large treewidth contains a k x k grid as a minor. This result is of fundamental importance in graph theory. This talk will continue the presentation of the proof of this result given in Diestel's textbook (Theorem 12.4.4). The goal of this talk is to prove Lemmas 12.4.6 - 12.4.9. See http://www.ms.unimelb.edu.au/~woodd/PAPERS/Books/Diestel4-Chapter12.pdf