Abstract
Network flow techniques are used to show that a conjecture of Fulkerson on the blocking polyhedron associated with the intersection of two matroids is true for transversal matroids. This leads to some general integral packing results for partial transversals, bipartite edge matchings, and subpermutation matrices. A computational example for bipartite edge matchings is included.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Edmonds, “Minimum partition of a matroid into independent subsets”,Journal of Research of the National Bureau of Standards 69B (1965) 67–72.
J. Edmonds, “Lehman's switching game and a theorem of Tutte and Nash—Williams”,Journal of Research of the National Bureau of Standards 69B (1965) 73–77.
J. Edmonds, “Submodular functions, matroids, and certain polyhedra”, in: R. Guy, ed.,Combinatorial structures and their applications, Proceedings of the Calgary International Conference, 1969 (Gordon and Breach, New York, 1970) pp. 69–87.
J. Edmonds, “Matroids and the greedy algorithm”,Mathematical Programming 1 (1971) 127–136.
J. Edmonds and D.R. Fulkerson, “Transversals and matroid partition”,Journal of Research of the National Bureau of Standards 69B (1965) 147–153.
J. Folkman and D.R. Fulkerson, “Edge colorings in bipartite graphs”, in: R.C. Bose and T.A. Dowling, eds.,Combinatorial mathematics and its applications, Proceedings of the Chapel Hill Conference, 1967 (University of North Carolina Press, Chapel Hill, 1969) pp. 561–577.
D.R. Fulkerson, “The maximum number of disjoint permutations contained in a matrix of zeroes and ones”,Canadian Journal of Mathematics 16 (1964) 729–735.
D.R. Fulkerson, “Blocking polyhedra”, in: B. Harris, ed.,Graph theory and its applications (Academic Press, New York, 1970) pp. 93–111.
D.R. Fulkerson, “Blocking and antiblocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168–194.
D.R. Fulkerson, “Disjoint common partial transversals”, in: L. Mirsky, ed.,Studies in pure mathematics (Academic Press, New York, 1971) pp. 107–112.
D.R. Fulkerson, “Packing rooted directed cuts in a weighted directed graph”,Mathematical Programming 6 (1974) 1–13.
D.R. Fulkerson and D.B. Weinberger, “Blocking pairs of polyhedra arising from network flows”,Journal of Combinatorial Theory 18 (1975) 265–283.
W.T. Tutte, “On the problem of decomposing a graph inton connected factors”,The Journal of the London Mathematical Society 36 (1961) 221–230.
D.B. Weinberger, “Investigations in the theory of blocking pairs of polyhedra”, Dissertation, Department of Operations Research Tech. Rept. No. 190, Cornell University, Ithaca (1973).
W.H. Cunningham, “An unbounded matroid intersection polyhedron”,Linear Algebra and Its Applications, to appear.
C.J.H. McDiarmid, “Blocking, anti-blocking and pairs of matroids and polymatroids”, Department of Operations Research Tech. Rept. No. 282, Cornell University, Ithaca (1976).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Weinberger, D.B. Transversal matroid intersections and related packings. Mathematical Programming 11, 164–176 (1976). https://doi.org/10.1007/BF01580384
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01580384