English

Lov\'asz-Schrijver PSD-operator on Claw-Free Graphs

Combinatorics 2016-12-09 v1 Optimization and Control

Abstract

The subject of this work is the study of \LS+\LS_+-perfect graphs defined as those graphs GG for which the stable set polytope \stab(G)\stab(G) is achieved in one iteration of Lov\'asz-Schrijver PSD-operator \LS+\LS_+, applied to its edge relaxation \estab(G)\estab(G). In particular, we look for a polyhedral relaxation of \stab(G)\stab(G) that coincides with \LS+(\estab(G))\LS_+(\estab(G)) and \stab(G)\stab(G) if and only if GG is \LS+\LS_+-perfect. An according conjecture has been recently formulated (\LS+\LS_+-Perfect Graph Conjecture); here we verify it for the well-studied class of claw-free graphs.

Cite

@article{arxiv.1612.02670,
  title  = {Lov\'asz-Schrijver PSD-operator on Claw-Free Graphs},
  author = {Silvia Bianchi and Mariana Escalante and Graciela Nasini and Annegret Wagler},
  journal= {arXiv preprint arXiv:1612.02670},
  year   = {2016}
}
R2 v1 2026-06-22T17:17:31.161Z