A short-proof of seymour's characterization of the matroids with the Max-Flow Min-Cut property

Abstract

Seymour proved that the set of odd circuits of a signed binary matroid (M, ∑) has the Max-Flow Min-Cut property if and only if it does not contain a minor isomorphic to (M(K4),E(K4)). We give a shorter proof of this result. © 2002 Elsevier Science (USA).