论文信息 - A quick proof of Seymour's theorem on t-joins

A quick proof of Seymour's theorem on t-joins

Abstract A very short proof of Seymour's theorem, stating that in bipartite graphs the minimum cardinality of a t -joint is equal to the maximum cardinality of an edge-disjoint packing of t -cuts, is given.

András Sebö

[1] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[2] A. Frank,et al. Covering directed and odd cuts , 1984 .

[3] P. Seymour. On Odd Cuts and Plane Multicommodity Flows , 1981 .

[4] L. Lovász. Combinatorial problems and exercises , 1979 .

[5] László Lovász,et al. On two minimax theorems in graph , 1976, J. Comb. Theory, Ser. B.