Graphs and Matroids - Fernanda Rivera Omana
Title:Erdős-Pósa theorem for matroids
| Speaker: | Fernanda Rivera Omana |
| Affiliation: | University of Waterloo |
| Room: | MC 6029 |
Abstract: We will look at an analogue theorem of the classical Erdős-Pósa Theorem. We prove a $GF(q)$-representable matroid analogue of Robertson and Seymour's theorem that planar graphs have an Erdős-Pósa property. Given a matroid $N$, we prove that for every matroid $M$ with bounded branch width, $M$ either contains $r$ skew copies of $N$, or there is a small perturbation of $M$ that doesn't contain $N$ as a minor.