Lov\'asz-Schrijver PSD-operator on Claw-Free Graphs
Abstract
The subject of this work is the study of +-perfect graphs defined as those graphs G for which the stable set polytope (G) is achieved in one iteration of Lov\'asz-Schrijver PSD-operator +, applied to its edge relaxation (G). In particular, we look for a polyhedral relaxation of (G) that coincides with +((G)) and (G) if and only if G is +-perfect. An according conjecture has been recently formulated (+-Perfect Graph Conjecture); here we verify it for the well-studied class of claw-free graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.