Lov\'asz-Schrijver PSD-operator on Claw-Free Graphs
classification
🧮 math.CO
math.OC
keywords
graphsperfectstabasz-schrijverclaw-freeconjectureestabpsd-operator
read the original abstract
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\'asz-Schrijver PSD-operator $\LS_+$, applied to its edge relaxation $\estab(G)$. In particular, we look for a polyhedral relaxation of $\stab(G)$ that coincides with $\LS_+(\estab(G))$ and $\stab(G)$ if and only if $G$ is $\LS_+$-perfect. An according conjecture has been recently formulated ($\LS_+$-Perfect Graph Conjecture); here we verify it for the well-studied class of claw-free graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.