The Rank Facets of the Stable Set Polytope for Claw-Free Graphs

This paper provides a complete characterization of the rank facets of the stable set polytope STAB(G) associated with a claw-free graphG. In particular, it is shown that a claw-free graphGproduces a rank facet of STAB(G) if and only if it can be obtained by means of two simple lifting procedures from three basic classes of graphs: (i) cliques, (ii) line graphs of minimal 2-connected hypomatchable graphs, and (iii) circulant graphsC??1??+1. As a by-product, a characterization of the rank facets of STAB(G) having right-hand side 2 is given.

[1]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[2]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

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

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

[5]  F. B. Shepherd,et al.  Formulations for the stable set polytope , 1992 .

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

[7]  V. Chvátal.  On the strong perfect graph conjecture , 1976 .

[8]  L. Lovász,et al.  Annals of Discrete Mathematics , 1986 .

[9]  Frank Harary,et al.  Graph Theory , 2016 .

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

[11]  Egon Balas,et al.  Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes , 1998 .

[12]  Leslie E. Trotter,et al.  Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

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

[14]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[15]  Jean-Luc Fouquet,et al.  A Strengthening of Ben Rebea's Lemma , 1993, J. Comb. Theory, Ser. B.

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

[17]  Najiba Sbihi,et al.  Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..