Premium
Packing T ‐joins
Author(s) -
Codato Paolo,
Conforti Michele,
Serafini Claudia
Publication year - 1996
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199608)22:4<293::aid-jgt2>3.0.co;2-g
Subject(s) - joins , combinatorics , mathematics , cardinality (data modeling) , disjoint sets , graph , characterization (materials science) , simple (philosophy) , discrete mathematics , computer science , programming language , philosophy , materials science , epistemology , data mining , nanotechnology
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.