On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs

We deal with non-rank facets of the stable set polytope of claw-free graphs. We extend results of Giles and Trotter [7] by (i) showing that for any nonnegative integer a there exists a circulant graph whose stable set polytope has a facet-inducing inequality with (a,a+1)-valued coefficients (rank facets have only coefficients 0, 1), and (ii) providing new facets of the stable set polytope with up to five different non-zero coefficients for claw-free graphs. We prove that coefficients have to be consecutive in any facet with exactly two different non-zero coefficients (assuming they are relatively prime). Last but not least, we present a complete description of the stable set polytope for graphs with stability number 2, already observed by Cook [3] and Shepherd [18].

[1]  Geir Dahl,et al.  Stable Set Polytopes for a Class of Circulant Graphs , 1999, SIAM J. Optim..

[2]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[3]  Gianpaolo Oriolo,et al.  Clique family inequalities for the stable set polytope of quasi-line graphs , 2003, Discret. Appl. Math..

[4]  Leslie E. Trotter,et al.  A class of facet producing graphs for vertex packing polyhedra , 1975, Discret. Math..

[5]  A. Tamura,et al.  A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph , 2001 .

[6]  William R. Pulleyblank,et al.  Formulations for the stable set polytope of a claw-free graph , 1993, IPCO.

[7]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[8]  Annegret Wagler,et al.  Rank-perfect and" weakly rank-perfect graphs , 2002, Math. Methods Oper. Res..

[9]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[10]  S. Poljak.  A note on stable sets and colorings of graphs , 1974 .

[11]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[12]  Antonio Sassano,et al.  The Rank Facets of the Stable Set Polytope for Claw-Free Graphs , 1997, J. Comb. Theory, Ser. B.

[13]  F. Bruce Shepherd,et al.  Applying Lehman's theorems to packing problems , 1995, Math. Program..

[14]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[15]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[16]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[17]  Leslie E. Trotter,et al.  On stable set polyhedra for K1, 3-free graphs , 1981, J. Comb. Theory, Ser. B.