作者: P.D. Seymour
DOI: 10.1016/S0195-6698(81)80033-9
关键词: Graphic matroid 、 Combinatorics 、 Discrete mathematics 、 Matroid 、 Commodity flow 、 Graph 、 Matroid partitioning 、 Mathematics
摘要: The max-flow min-cut theorem and the two-commodity flow may both be interpreted as equalities between maximum feasible packing of certain circuits a graph minimum capacity cocircuits, thus expressed in matroid terms. We study matroids which similar “ k -commodity theorem” holds. (Thus for = 1 2 it holds polygon graphs.) find example that such bond graphs all ; that, any matroid, if 4, then . obtain excluded minor characterizations every ⩾ 2, also case is still unsolved.