A construction for binary matroids (Q1102297)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A construction for binary matroids |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A construction for binary matroids |
scientific article |
Statements
A construction for binary matroids (English)
0 references
1987
0 references
A family of subsets of a ground set closed under the operation of taking symmetric differences is the family of cycles of a binary matroid, whose circuits are the minimal members of this collection. Using this fact two binary matroids are derived from graphic and ergodic matroids. Cocycles of the first one are cutsets or balancing sets. Cocycles of the second one are Eulerian subgraphs or T-joins. Then the problem of finding a minimum weight circuit and cocircuit in these matroids is studied.
0 references
graphic matroids
0 references
minimum weight cocircuit
0 references
circuits
0 references
binary matroids
0 references
ergodic matroids
0 references
cutsets
0 references
balancing sets
0 references
Eulerian subgraphs
0 references
T-joins
0 references
minimum weight circuit
0 references
0 references
