Abstract
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. © 1996 John Wiley & Sons, Inc.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
