1 problem

A graph is near-perfect if its stable set polytope is defined by non-negativity constraints, clique constraints, and the full-rank constraint $\sum_{u\in V(G)}x_u\leq\alpha(G)$, wh…