A splitter theorem for large 3-connected graphs

Combinatorics Seminar
Friday, November 2, 2018 - 3:00pm
1 hour (actually 50 minutes)
Skiles 005
Louisiana State University

The purpose of this talk is to explain the following result.
Let n > 2 be an integer. Let H be a 3-connected minor of a
3-connected graph G. If G is sufficiently large (relative to
n and the size of H) then G has a 3-connected minor obtained
from H by “adding” K_{3,n} or W_n.