Matroid 3-connectivity and branch width
Combinatorics
2014-12-12 v2
Abstract
We prove that, for each nonnegative integer k and each matroid N, if M is a 3-connected matroid containing N as a minor, and the the branch width of M is sufficiently large, then there is a k-element subset X of E(M) such that one of M\X and M/X is 3-connected and contains N as a minor.
Keywords
Cite
@article{arxiv.1107.3914,
title = {Matroid 3-connectivity and branch width},
author = {Jim Geelen and Stefan H. M. van Zwam},
journal= {arXiv preprint arXiv:1107.3914},
year = {2014}
}
Comments
21 pages