The Total Matching Polytope of Complete Bipartite Graphs

03/01/2023
by   Yuri Faenza, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/30/2021

Facets of the Total Matching Polytope for bipartite graphs

The Total Matching Polytope generalizes the Stable Set Polytope and the ...
research
05/26/2018

Popular Matchings and Limits to Tractability

We consider popular matching problems in both bipartite and non-bipartit...
research
01/21/2020

Bipartite Perfect Matching as a Real Polynomial

We obtain a description of the Bipartite Perfect Matching decision probl...
research
11/16/2018

Popularity, stability, and the dominant matching polytope

Let G = (A ∪ B, E) be an instance of the stable marriage problem with st...
research
05/15/2021

On the Complexity of Nucleolus Computation for Bipartite b-Matching Games

We explore the complexity of nucleolus computation in b-matching games o...
research
03/02/2022

Algebraic Representations of Unique Bipartite Perfect Matching

We obtain complete characterizations of the Unique Bipartite Perfect Mat...
research
05/27/2019

Farsighted Collusion in Stable Marriage Problem

The Stable Marriage Problem, as proposed by Gale and Shapley, considers ...

Please sign up or login with your details

Forgot password? Click here to reset