Abstract
The matching polytope is the convex hull of the incidence vectors of all (not necessarily perfect) matchings of a graphG. We consider here the problem of computing the dimension of the face of this polytope which contains the maximum cardinality matchings ofG and give a good characterization of this quantity, in terms of the cyclomatic number of the graph and families of odd subsets of the nodes which are always nearly perfectly matched by every maximum matching.
This is equivalent to finding a maximum number of linearly independent representative vectors of maximum matchings ofG; the size of such a set is called thematching rank ofG.
We also give in the last section a way of computing that rank independently of those parameters.
Note that this gives us a good lower bound on the number of those matchings.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Berge,Graphes et hypergraphes (Dunod, Paris, 1970).
V. Chvatal, “On certain polytopes associated with graphs”,Journal of Combinatorial Theory B 18 (1975) 138–154.
J. Edmonds, “Path, trees and flowers”,Canadian Journal of Mathematics 17 (1965) 449–467.
J. Edmonds, “Maximum matchings and a polyhedron with (0–1) vertices”,Journal of Research of the National Bureau of Standards-ℬ, Mathematics and Mathematical Physics 69B (1965) 125–130.
L. Lovasz, “On the structure of factorizable graphs”,Acta Mathematica Academiae Scientiarum Hungaricae 23 (1972) 179–195.
T.S. Motzkin, H. Raiffa, G.L. Thompson and R.M. Thrall, “The double description method”, in: H.W. Kuhn and A.W. Tucker, eds.,Contribution to the theory of games, Vol II, Annals of Mathematics Study No. 28 (Princeton University Press, Princeton, NJ, 1953) pp. 51–73.
D. Naddef, “Rang des couplages maximum d'un graphe”, Thèse de 3-ème cycle, Université Scientifique et Médicale de Grenoble (France, 1978).
W. Pulleyblank, J. Edmonds, “Facets of the 1-matching polyhedra”, in: C. Berge and D. Ray-Chaudhari, eds.,Hypergraph seminar (Springer, Berlin, 1974) pp. 214–242.
W. Pulleyblank, “Faces of matching polyhedra”, Ph.D. Thesis, University of Waterloo (1973).