加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本