Partitioning matroids with only small cocircuits

Document Type

Article

Publication Date

3-1-2002

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.

Publication Source (Journal or Book title)

Combinatorics Probability and Computing

First Page

191

Last Page

197

This document is currently not available here.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 1
  • Usage
    • Abstract Views: 9
  • Captures
    • Readers: 2
see details

Share

COinS