2 problems

0 votes0 replies2 views
The near-bipartite inequality conjecture for ${\operatorname{LS}}_+$ -perfect graphs
Let ${\operatorname{LS}}_+(G)$ denote the Lovász–Schrijver positive semidefinite relaxation of the stable set polytope, and call $G$ ${\operatorname{LS}}_+$ -perfect when…
Conjectureopennear-bipartite-graphs semidefinite-programming stable-set-polytopesarXiv posted 2 days ago
0 votes0 replies0 views
The full-support facet conjecture for ${\operatorname{LS}}_+$ -perfect graphs
Let ${\operatorname{LS}}_+(G)$ denote the Lovász–Schrijver positive semidefinite relaxation of the stable set polytope. A graph is ${\operatorname{LS}}_+$ -perfect when…
Conjectureopennear-bipartite-graphs semidefinite-programming stable-set-polytopesarXiv posted 2 days ago

The near-bipartite inequality conjecture for LS⁡+{\operatorname{LS}}_+LS+​-perfect graphs