Friday, November 2, 2012
3:30 pm, MC 5158

Jim Geelen
University of Waterloo

Connectivity in matroids and graphs

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.