Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-07T23:12:28.376Z Has data issue: false hasContentIssue false
  • English
  • Français

Partitioning Matroids with Only Small Cocircuits

Published online by Cambridge University Press:  25 April 2002

BOGDAN OPOROWSKI
BOGDAN OPOROWSKI
Affiliation:
Department of Mathematics, Louisiana State University, Baton Rouge, Louisiana 70803-4918, USA (e-mail: bogdan@math.lsu.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 11 , Issue 2 , March 2002 , pp. 191 - 197
Copyright
2002 Cambridge University Press