Partitioning matroids with only small cocircuits
We show that, for every positive integer c*, there is an integer n such that, if M is a matroid whose largest cocircuit has size c*, then E(M) can be partitioned into two sets E1 and E2 such that every connected component of each of M|E1 and M|E2 has at most n elements.
Publication Source (Journal or Book title)
Combinatorics Probability and Computing
Oporowski, B. (2002). Partitioning matroids with only small cocircuits. Combinatorics Probability and Computing, 11 (2), 191-197. https://doi.org/10.1017/S0963548301004916