The stable set polytope of a graph , denoted as STAB(), is the convex hull of all the incidence vectors of stable sets of . To describe a linear system which defines STAB() seems to be a difficult task in the general case. In this paper we present a complete description of the stable set polytope of (,triangle)-free graphs (and more generally of (,paw)-free graphs). For that we combine different tools, in the context of a well known result of Chv'atal \cite{Chvatal1975} which allows to focus just on prime facet-inducing graphs, with particular reference to a structure result on prime (,triangle)-free graphs due to Brandst"adt et al. \cite{BraKleMah2005}. Also we point out some peculiarities of new facet-inducing graphs detected along this study with the help of a software.

生成讲解博客的中文版本

生成AI智能校验的中文版本