The Graph Minor Theorem
Speaker: Jan Reimann, Penn State University
Abstract: Undirected graphs can be partially ordered through the minor relation, where one graph can be obtained from the other by deleting edges and vertices and by contracting edges. The graph minor theorem states that undirected graphs form a well quasi-ordering under the minor relation. It was proved by Robertson and Seymour in a span of twenty papers from 1983 to 2004. This talk gives an introduction to the graph minor theorem and outlines the basic ideas used to prove it.
Room Reservation Information
Room Number: 315 McAllister
Time: 2:30pm - 4:00pm