Almost all webs are not rank-perfect (Q2583128)

A web \(W^k_n\) is a graph with vertices \(1,\dots ,n\) where \(ij\), with \(i\neq j\), is an edge if \(i\) and \(j\) differ by at most \(k\) (mod \(n\)). Webs are also called circulant graphs [\textit{V. Chvátal}, J. Comb. Theory, Ser. B 20, 139--141 (1976; Zbl 0293.05117)]. The stable set polytope of a graph is defined as the convex hull of the incidence vectors of all stable sets of the graph. In this paper the authors investigate rank constraints [see, e.g., \textit{A. Galluccio} and \textit{A. Sassano}, J. Comb. Theory, Ser. B 69, 1--38 (1997; Zbl 0867.05034)] and prove, building on their construction for non-rank facets [``A construction for non-rank facets of stable set polytopes of webs'', to appear in Eur. J. Comb.], that stable set polytopes of almost all webs with clique number at least 5 admit non-rank facets. They also present a conjecture how to construct all facets of the stable set polytopes of webs.