The Total Matching Polytope of Complete Bipartite Graphs
From MaRDI portal
Publication:6428019
arXiv2303.00328MaRDI QIDQ6428019FDOQ6428019
Authors: Yuri Faenza, Luca Ferrarini 
Publication date: 1 March 2023
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.
This page was built for publication: The Total Matching Polytope of Complete Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428019)
