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 -perfect graphs defined as those graphs for which the stable set polytope is achieved in one iteration of Lov\'asz-Schrijver PSD-operator , applied to its edge relaxation . In particular, we look for a polyhedral relaxation of that coincides with and if and only if 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.
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}
}