Lift-and-project ranks of the stable set polytope of joined a-perfect graphs

摘要

In this paper we study lift-and-project polyhedral operators defined by Lovasz and Schrijver and Balas, Ceria and Cornuejols on the clique relaxation of the stable set polytope of webs. We compute the disjunctive rank of all webs and consequently of antiwebs. We also obtain the disjunctive rank of the antiweb constraints for which the complexity of the separation problem is still unknown. Finally, we use our results to provide bounds of the disjunctive rank of larger classes of graphs as joined a-perfect graphs, where near-bipartite graphs belong to. (C) 2015 Elsevier B.V. All rights reserved.