On the linear extension complexity of stable set polytopes for perfect graphs

Hao Hu, Monique Laurent
2018 European journal of combinatorics (Print)  
We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew partitions. Exploiting the link between extension complexity and the nonnegative rank of an associated slack matrix, we investigate the behaviour of the extension complexity under these graph operations. We show bounds for the extension complexity of the
more » ... set polytope of a perfect graph G depending linearly on the size of G and involving the depth of a decomposition tree of G in terms of basic perfect graphs.
doi:10.1016/j.ejc.2018.02.014 fatcat:2xt5svpcu5gotjfzygpiiq5xke