The Total Matching Polytope of Complete Bipartite Graphs

03/01/2023

∙

by   Yuri Faenza, et al.

∙

0

∙

share

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.