We verify a conjecture regarding circuits of a binary matroid. A circuit cover of a integer-weighted matroid (M, p) is a list of circuits of M such that each element e is in exactly p(e) circuits from the list. We characterize those binary matroids for which two obvious necessary conditions for a we
Compositions for matroids with the Fulkerson property
β Scribed by Sunil Chopra
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 820 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The duality of infinite matroids with coefficients defined in [1] and the duality of Klee matroids [5], a generalization to the infinite case of matroid closure operators, are not identical. In this paper we characterize those Klee matroids arising as closure operators of matroids with coefficients.
Seymour proved that the set of odd circuits of a signed binary matroid Γ°M; SΓ has the Max-Flow Min-Cut property if and only if it does not contain a minor isomorphic to Γ°MΓ°K 4 Γ; EΓ°K 4 ΓΓ: We give a shorter proof of this result. # 2002 Elsevier Science (USA)