The Total Matching Polytope of Complete Bipartite Graphs
Yuri Faenza, Luca Ferrarini
TL;DR
This paper introduces new facet-defining inequalities and provides comprehensive descriptions of the total matching polytope for complete bipartite graphs, advancing understanding in combinatorial optimization.
Contribution
It presents novel inequalities and compact descriptions for the total matching polytope, extending the theoretical framework for complete bipartite graphs.
Findings
New facet-defining inequalities for the total matching polytope
Exponential-sized non-redundant description in original space
Compact extended space description
Abstract
The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant description in the original space and a compact description in an extended space of the total matching polytope of complete bipartite graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Metal complexes synthesis and properties