Partitioning Matroids with Only Small Cocircuits
Bogdan Oporowski · Combinatorics Probability Computing · 2002
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[mid ]E1 and M[mid ]E2 has at most n elements.