On a class of strong valid inequalities for the connected matching polytope
Combinatorics
2023-10-24 v2 Discrete Mathematics
Abstract
We identify a family of nontrivial facets of the connected matching polytope of a graph , that is, the convex hull of incidence vectors of matchings in whose covered vertices induce a connected subgraph. Accompanying software to further inspect the polytope of an input graph is available.
Keywords
Cite
@article{arxiv.2309.14019,
title = {On a class of strong valid inequalities for the connected matching polytope},
author = {Phillippe Samer},
journal= {arXiv preprint arXiv:2309.14019},
year = {2023}
}
Comments
8 pages, 1 figure. Submitted for publication