Tutte seminar - Jim Geelen

Connectivity in matroids and graphs

Abstract:

Tutte's Wheels Theorem gives an inductive way to construct simple 3-connected graphs. We give an analogous result for a weak version of k-connectivity, for arbitrary k. The result holds, more generally, for all matroids, and has applications to matroid representation theory. 

This is joint work with Bert Gerards, Tony Huynh, and Stefan van Zwam.