The Robertson-Seymour graph minor theorem

Logic Seminar

Meeting Details

For more information about this meeting, contact Kristin Berrigan, Jan Reimann, Linda Westrick.

Speaker: Jan Reimann, Penn State University

Abstract: An undirected graph H is a minor of graph G if H can be obtained from G by deleting edges and vertices and by contracting edges. The minor relation is a partial order on graphs, and the celebrated graph minor theorem, proved by Robertson and Seymour in a series of twenty papers spanning almost twenty years, establishes that this partial ordering is actually a well quasi-ordering. In this talk, I will survey the basic strategies and ideas used to obtain this theorem.

Room Reservation Information

Room Number: 315 McAllister

Date: 10/22/2019

Time: 2:30pm - 4:00pm