2000 character limit reached
On a class of strong valid inequalities for the connected matching polytope (2309.14019v2)
Published 25 Sep 2023 in math.CO and cs.DM
Abstract: We identify a family of $O(|E(G)|2)$ nontrivial facets of the connected matching polytope of a graph $G$, that is, the convex hull of incidence vectors of matchings in $G$ whose covered vertices induce a connected subgraph. Accompanying software to further inspect the polytope of an input graph is available.