School Seminars and Colloquia

The Grid Minor Theorem, Part 3

Discrete Structures and Algorithms (Reading Group): Graph Minors

by David Wood


Institution: The University of Melbourne
Date: Mon 7th November 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). See http://www.ms.unimelb.edu.au/~woodd/PAPERS/Books/Diestel4-Chapter12.pdf