On stable set polyhedra for K1, 3-free graphs

Abstract We give several classes of facets for the convex hull of incidence vectors of stable sets in a K 1,3 -free graph, including facets with ( a, a + 1)-valued coefficients, where a = 1, 2, 3,…. These provide counterexamples to three recent conjectures concerning such facets. We also give a necessary and sufficient condition for a minimal imperfect graph to be an odd hole or an odd antihole and indicate that minimal imperfect K 1,3 -free graphs satisfy the condition.

[1]  M. Padberg.  Almost integral polyhedra related to certain combinatorial optimization problems , 1976 .

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

[3]  D. R. Fulkerson.  On the Perfect Graph Theorem , 1973 .

[4]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

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

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

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

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

[9]  D. R. Fulkerson,et al.  Anti-blocking polyhedra , 1972 .

[10]  Manfred W. Padberg,et al.  Perfect zero–one matrices , 1974, Math. Program..

[11]  Alan Tucker,et al.  Critical perfect graphs and perfect 3-chromatic graphs , 1977, J. Comb. Theory, Ser. B.

[12]  Alan Tucker,et al.  BERGE'S STRONG PERFECT GRAPH CONJECTURE , 1979 .

[13]  George L. Nemhauser,et al.  Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs , 1981, Discret. Math..

[14]  L. Lovász.  A Characterization of Perfect Graphs , 1972 .

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

[16]  A. Tucker,et al.  Coloring a Family of Circular Arcs , 1975 .

[17]  Leslie E. Trotter,et al.  Graphical properties related to minimal imperfection , 1979, Discret. Math..

[18]  K. R. Parthasarathy,et al.  The strong perfect-graph conjecture is true for K1, 3-free graphs , 1976, J. Comb. Theory, Ser. B.

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

[20]  Najiba Sbihi.  Etude des stables dans les graphes sans étoile , 1978 .

[21]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..