Hostname: page-component-7b7567c8c-8tzhz Total loading time: 0 Render date: 2026-11-19T13:47:27.332Z Has data issue: false hasContentIssue false

Cocircuit coverings and packings for binary matroids

Published online by Cambridge University Press:  24 October 2008

James G. Oxley
Affiliation:
Mathematical Institute, Oxford
Rights & Permissions [Opens in a new window]

Extract

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.

If M is an arbitrary loopless matroid with ground set E(M) and rank function ρ, then let α(M) be the minimum size of a set of cocircuits of M, whose union is E(M), and let β(M) be the maximum size of a set of pairwise disjoint cocircuits of M. The following conjecture is based on Gallai's theorem that the vertex-stability and vertex-covering numbers of a graph G sum to the number of vertices of G (1).

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1978