1 problem

The $N_+$ -Perfect Graph Conjecture
$N_+$ -Perfect Graph Conjecture. The stable set polytope of every $N_+$ -perfect graph can be described by facet-defining inequalities with near-bipartite support.
opengraph-theory semidefinite-relaxations stable-set-polytopes
0 responses
04

The N+N_+N+​-Perfect Graph Conjecture