PackingT-joins

✍ Scribed by Codato, Paolo; Conforti, Michele; Serafini, Claudia

• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 212 KB
• Volume: 22
• Category: Article
• ISSN: 0364-9024
• DOI: 10.1002/(sici)1097-0118(199608)22:4<293::aid-jgt2>3.0.co;2-g

✦ Synopsis

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 K2,3. We give a simple "graphic" proof of this fact.