2000 character limit reached
The Total Matching Polytope of Complete Bipartite Graphs (2303.00328v2)
Published 1 Mar 2023 in cs.DM and math.CO
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.