ALMOST PERFECT MATRICES AND GRAPHS

We introduce the notions of w-projection and k-projection that map almost integral polytopes associated with almost perfect graphs G with n nodes from Rn into Rn-w where w is the maximum clique size in G. We show that C. Berge's strong perfect graph conjecture is correct if and only if the projection (of either kind) of such polytopes is again almost integral in Rn-w. Several important properties of w-projections and k-projections are established. We prove that the strong perfect graph conjecture is wrong if an w-projection and a related k-projection of an almost integral polytope with 2 ⤠w ⤠(n - 1)/2 produce different polytopes in Rn-w.Statistics Working Papers Serie