This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| matching polytope | |
|---|---|
| Name | Matching polytope |
| Field | Combinatorics, Operations Research |
| Related | Perfect matching, Birkhoff polytope, Stable matching |
matching polytope is the convex hull of incidence vectors of matchings in a finite graph. It arises in Combinatorics, Operations Research, Linear Programming, and Polyhedral combinatorics as a central object connecting graph theory, optimization, and algebraic structure. The polytope encodes combinatorial properties of graphs and underpins algorithmic results for problems studied by scholars at institutions like Courant Institute, Princeton University, and organizations such as Bell Labs.
Given a finite graph G = (V, E), the matching polytope is defined as the convex hull of 0–1 vectors x in R^{|E|} that represent matchings. The construction is standard in texts from George Dantzig and Jack Edmonds and appears in treatises at MIT and Stanford University. For each edge e the coordinate x_e equals 1 if e is chosen and 0 otherwise; incidence constraints relate edges to vertices appearing in works associated with Kurt Gödel's combinatorial lectures and conferences at International Mathematical Union meetings.
Facets of the polytope correspond to inequalities that are valid and facet-defining for the convex hull of matchings. Classical facet descriptions include degree constraints and blossom inequalities introduced by Jack Edmonds and developed further in collaboration with researchers at IBM Research and ETH Zurich. The face lattice interacts with polyhedral studies by scholars from University of Waterloo and École Polytechnique, reflecting connections to the Birkhoff polytope and to facets studied by contributors to the Journal of Combinatorial Theory.
For bipartite graphs the polytope coincides with the assignment polytope studied in contexts involving Leonid Kantorovich and Amartya Sen-adjacent optimization histories; all extreme points are integral and coincide with perfect and partial matchings, a fact exploited at Harvard University and Yale University in scheduling research. For general graphs additional inequalities, notably blossom constraints, are necessary; these were characterized in seminal work at Bell Labs and formalized in monographs used at University of California, Berkeley and Columbia University.
Linear programming formulations over the polytope yield exact solutions for maximum-weight matching when the polytope description is tight. The polytope underpins primal-dual algorithms taught at Stanford University and Massachusetts Institute of Technology and features in integrality proofs connected to results by Jack Edmonds and follow-up by researchers at Microsoft Research and Google Research. Dual variables correspond to vertex prices in assignment interpretations used in studies at INRIA and Max Planck Institute.
Algorithms exploiting the matching polytope include Edmonds' blossom algorithm, combinatorial optimization routines employed at Bell Labs and in textbooks used at Princeton University. Applications span network design problems considered at Bell Labs, crew scheduling investigated at American Airlines, and resource allocation models explored at World Bank and International Monetary Fund policy research. Integer programming solvers from IBM and Gurobi use polyhedral cuts derived from facet structure analyzed by researchers at Carnegie Mellon University.
Key theorems establish integrality conditions, facial descriptions, and adjacency properties; central results were proved by Jack Edmonds and extended in collaborations across Northwestern University, University of Toronto, and Cornell University. The total unimodularity of constraint matrices for bipartite instances ties to foundational linear algebra work associated with John von Neumann and Oskar Morgenstern in game-theoretic contexts. Further structural theorems link to matroid theory developed at University of Oxford and University of Cambridge.
Generalizations include fractional matching polytopes, b-matching polytopes, and hypergraph matching polytopes studied in seminars at Institute for Advanced Study and conferences organized by the American Mathematical Society. Connections to the Traveling Salesman Problem polytope, stable set polytope, and to relaxations used in semidefinite programming have been pursued at ETH Zurich and Princeton University by researchers in combinatorial optimization and theoretical computer science. Ongoing work at institutions like UC Berkeley and NYU explores algebraic and geometric extensions linking to tropical geometry and to representation-theoretic perspectives developed at Institute Henri Poincaré.
Category:Polytopes