Partitioning Matroids with Only Small Cocircuits

Authors:
Bogdan Oporowski
Affiliations:
Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana 70803-4918, USA (e-mail: bogdan@math.lsu.edu)
Venue:
Combinatorics, Probability and Computing
Year:
2002

Citing 3
Cited 1

Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
On infinite antichains of matroids

Journal of Combinatorial Theory Series B
Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5

Journal of Combinatorial Theory Series B

Obstructions to branch-decomposition of matroids

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.