2000 character limit reached
On a class of strong valid inequalities for the connected matching polytope
Published 25 Sep 2023 in math.CO and cs.DM | (2309.14019v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.