Colloquium - Eric Ramos

Date: December 3, 2020

Time: 1:00PM - 2:00PM

Location: Zoom

Speaker: Eric Ramos, University of Oregon

Description:

Title: The graph minor theorem, and graph configuration spaces
Abstract: Perhaps one of the most well-known theorems in graph theory is the celebrated Graph Minor Theorem of Robertson and Seymour. This theorem states that in any infinite collection of finite graphs, there must be a pair of graphs for which one is obtained from the other by a sequence of edge contractions and deletions. In this talk, I will present work of Nick Proudfoot, Dane Miyata, and myself which proves a categorified version of the graph minor theorem. As an application, we show how configuration spaces of graphs must display some strongly uniform properties. We then show how this result can be seen as a vast generalization of a variety of classical theorems in graph configuration spaces.