A construction for binary matroids (Q1102297)

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.