Perfectly Matchable Set Polynomials and $h^{\ast }$-polynomials for Stable Set Polytopes of Complements of Graphs

Robert Davis, Florian Kohl

A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomia…