Lovász–Schrijver PSD-operator and the stable set polytope of claw-free graphs

The subject of this work is the study of LS+-perfect graphs defined as those graphs G for which the stable set polytope STAB(G) is achieved in one iteration of Lovász–Schrijver PSD-operator LS+, applied to its edge relaxation ESTAB(G). The recently formulated LS+-Perfect Graph Conjecture aims at a c...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 332; pp. 70 - 86
Main Authors Bianchi, Silvia M., Escalante, Mariana S., Nasini, Graciela L., Wagler, Annegret K.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.06.2023
Elsevier
Subjects
Claw-free graphs
Computer Science
Discrete Mathematics
Semidefinite relaxation
Stable set problem
Claw-free graphs
Stable set problem
Semidefinite relaxation
Semidefinite relaxation; Stable set problem; Claw-free graphs
Online AccessGet full text

Cover

More Information
Summary:The subject of this work is the study of LS+-perfect graphs defined as those graphs G for which the stable set polytope STAB(G) is achieved in one iteration of Lovász–Schrijver PSD-operator LS+, applied to its edge relaxation ESTAB(G). The recently formulated LS+-Perfect Graph Conjecture aims at a characterization of this family of graphs, through the structure of the facet defining inequalities of the stable set polytope. The main contribution of this work is to verify it for the well-studied class of claw-free graphs.
ISSN:0166-218X
DOI:10.1016/j.dam.2023.01.012