2000 character limit reached
Facets of the Total Matching Polytope for bipartite graphs (2111.15528v1)
Published 30 Nov 2021 in cs.DM and math.CO
Abstract: The Total Matching Polytope generalizes the Stable Set Polytope and the Matching Polytope. In this paper, we give the perfect formulation for Trees and we derive two new families of valid inequalities, the balanced biclique inequalities which are always facet-defining and the non-balanced lifted biclique inequalities obtained by a lifting procedure, which are facet-defining for bipartite graphs. Finally, we give a complete description for Complete Bipartite Graphs.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.