Packing T-joins

A consequence of Seymour's characterization of binary clutters with the Max Flow Min Cut property is that the minimum cardinality of a T-cut is equal to the largest number of edge-disjoint T-joins in every graph that cannot be T-contracted to an odd K_2,3. We give a simple “graphic” proof of this fact. © 1996 John Wiley & Sons, Inc.