The stable set polytope of (P6,triangle)-free graphs and new facet-inducing graphs
Abstract
The stable set polytope of a graph G, denoted as STAB(G), is the convex hull of all the incidence vectors of stable sets of G. To describe a linear system which defines STAB(G) seems to be a difficult task in the general case. In this paper we present a complete description of the stable set polytope of (P6,triangle)-free graphs (and more generally of (P6,paw)-free graphs). For that we combine different tools, in the context of a well known result of Chv\'atal Chvatal1975 which allows to focus just on prime facet-inducing graphs, with particular reference to a structure result on prime (P6,triangle)-free graphs due to Brandst\"adt et al. BraKleMah2005. Also we point out some peculiarities of new facet-inducing graphs detected along this study with the help of a software.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.