Advertisement

A Short Proof of Seymour’s Characterization of the Matroids with the Max-Flow Min-Cut Property

  • Bertrand Guenin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2337)

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(K 4), E(K 4)). We give a shorter proof of this result.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Geelen and B. Guenin. Packing odd circuits in Eulerian graphs. To appear in J. Comb. Theory Ser. B. Google Scholar
  2. 2.
    P.D. Seymour. The Matroids with the Max-Flow Min-Cut property. J. Comb.Theory Ser. B, 23:189–222, 1977.MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Bertrand Guenin
    • 1
  1. 1.Department of Combinatorics and Optimization, Faculty of MathematicsUniversity of WaterlooWaterlooCanada

Personalised recommendations