Abstract
A family ℱ of cuts of an undirected graphG=(V, E) is known to have the weak MFMC-property if (i) ℱ is the set ofT-cuts for someT⊆V with |T| even, or (ii) ℱ is the set of two-commodity cuts ofG, i.e. cuts separating any two distinguished pairs of vertices ofG, or (iii) ℱ is the set of cuts induced (in a sense) by a ring of subsets of a setT⊆V. In the present work we consider a large class of families of cuts of complete graphs and prove that a family from this class has the MFMC-property if and only if it is one of (i), (ii), (iii).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. Birkhoff,Lattice theory. Third edition, Amer. Math. Soc., Providence, R. I., 1967.
J. Edmonds andE. L. Johnson, Matchings, Euler tours and Chinese postman,Math. Programming 5 (1973), 88–124.
D. R. Fulkerson, Blocking polyhedra, in:Graph Theory and its Applications (ed. Harris B., Acad. Press, NY, 1970) 93–112.
T. C. Hu, Multi-commodity network flows,Oper. Res. 11 (1963), 344–360.
A. V. Karzanov, A generalized MFMC-property and multicommodity cut problems, in:Finite and Infinite Sets (Proc. of 6th Hungarian Combinatorial Colloquium, Eger, 1981) (ed. Hajnal et al., North-Holland, Amsterdam, 1984), 443–486.
A. Lehman, On the width-length inequality,Math. Programming 17 (1979), 403–417.
L. Lovász, 2-matchings and 2-covers of hypergraphs,Acta Math. Acad. Sci. Hung. 26 (1975), 433–444.
P. D. Seymour, The matroids with the max-flow min-cut property,J. Combinatorical Theory (B)23 (1977), 189–222.
P. D. Seymour, A two-commodity cut theorem,Discrete Math. 23 (1978), 177–181.
P. D. Seymour, On odd cuts and plane multicommodity flows,Proc. London Math. Soc. (3)42 (1981), 178–192.