School Seminars and Colloquia

Kuratowski's Theorem and Related Topics

Discrete Structures and Algorithms (Reading Group): Graph Minors

by David Wood

Institution: The University of Melbourne
Date: Mon 5th September 2011
Time: 11:00 AM
Location: Room 107, Richard Berry Building

Abstract: This talk will introduce some of the basic techniques for proving theorems about graph minors. In particular, we will prove Kuratowski's famous characterisation of planar graphs (following the proof presented in Diestel's "Graph Theory" textbook). As preparation, read about graph connectivity and Menger's Theorem.