ALMOST PERFECT MATRICES AND GRAPHS

We introduce the notions of!-projection and-projection that map almost integral polytopes associated with almost perfect graphs G with n nodes from R n into R n,! where! 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 R n,!. Several important properties of!-projections and-projections are established. We prove that the strong perfect graph conjecture is wrong if an!-projection and a related-projection of an almost integral polytope with 2! (n, 1)=2 produce di erent polytopes in R n,!

Almost perfect matrices and graphs

We introduce the notions of #omega#-projection and #kappa#-projection that map almost integral polytopes associated with almost perfect graphs G with n nodes from R"n into R"n"-"#omega# where #omega# 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 polytropes is again almost integral in "n"-"#omega#. Several important properties of #omega#-projections and #kappa#-projections are established. We prove that the strong perfect graph conjecture is wrong if an #omega#-projection and a related #kappa#-projection of an almost integral polytope with 2#<=##omega##<=# (n-1)/2 produce different polytopes in R"n"-"#omega#. (orig.)Available from TIB Hannover: RN 4052(98874) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman