AI Chat AI Image Generator AI Video Text to Speech

Facets of the Total Matching Polytope for bipartite graphs

11/30/2021

∙

by Luca Ferrarini, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 03/01/2023

The Total Matching Polytope of Complete Bipartite Graphs

The total matching polytope generalizes the stable set polytope and the ...

0 Yuri Faenza, et al. ∙

research

∙ 03/03/2021

Facets of the cone of exact games

The class of exact transferable utility coalitional games, introduced in...

0 Milan Studeny, et al. ∙

research

∙ 10/13/2020

On the Complexity of Some Facet-Defining Inequalities of the QAP-polytope

The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem t...

0 Pawan Aurora, et al. ∙

research

∙ 01/21/2020

Bipartite Perfect Matching as a Real Polynomial

We obtain a description of the Bipartite Perfect Matching decision probl...

0 Gal Beniamini, et al. ∙

research

∙ 05/20/2021

Total Coloring and Total Matching: Polyhedra and Facets

A total coloring of a graph G = (V, E) is an assignment of colors to ver...

0 Luca Ferrarini, et al. ∙

research

∙ 03/02/2022

Algebraic Representations of Unique Bipartite Perfect Matching

We obtain complete characterizations of the Unique Bipartite Perfect Mat...

0 Gal Beniamini, et al. ∙

research

∙ 04/26/2019

Polyhedral Properties of the Induced Cluster Subgraphs

A cluster graph is a graph whose every connected component is a complete...

0 Seyedmohammadhossein Hosseinian, et al. ∙