Near-perfect matrices

AbstractA 0, 1 matrixA isnear-perfect if the integer hull of the polyhedron {x⩾0: Ax⩽ $$\bar 1$$ } can be obtained by adding one extra (rank) constraint. We show that in general, such matrices arise as the cliquenode incidence matrices of graphs. We give a colouring-like characterization of the corresponding class of near-perfect graphs which shows that one need only check integrality of a certain linear program for each 0, 1, 2-valued objective function. This in contrast with perfect matrices where it is sufficient to check 0, 1-valued objective functions. We also make the following conjecture: a graph is near-perfect if and only if sequentially lifting any rank inequality associated with a minimally imperfect graph results in the rank inequality for the whole graph. We show that the conjecture is implied by the Strong Perfect Graph Conjecture. (It is also shown to hold for graphs with no stable set of size eleven.) Our results are used to strengthen (and give a new proof of) a theorem of Padberg. This results in a new characterization of minimally imperfect graphs: a graph is minimally imperfect if and only if both the graph and its complement are near-perfect.

[1]  L. Trotter,et al.  Integer Rounding for Polymatroid and Branching Optimization Problems , 1981 .

[2]  W. R. Pulleyblank,et al.  Polyhedral Combinatorics , 1989, ISMP.

[3]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[4]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[5]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[6]  D. R. Fulkerson.  On the Perfect Graph Theorem , 1973 .

[7]  L. Lovász.  A Characterization of Perfect Graphs , 1972 .

[8]  Harold Neville Vazeille Temperley,et al.  Graph theory and applications , 1981 .

[9]  L. E. Trotter,et al.  Graphical Properties Related to Minimal Imperfection , 1984 .

[10]  Alan Tucker,et al.  Critical perfect graphs and perfect 3-chromatic graphs , 1977, J. Comb. Theory, Ser. B.

[11]  V. Chvátal,et al.  An Equivalent Version of the Strong Perfect Graph Conjecture , 1984 .

[12]  V. Chvátal.  On the strong perfect graph conjecture , 1976 .

[13]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[14]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[15]  Kathleen Barbara Cameron.  Polyhedral and algorithmic ramifications of antichains , 1982 .

[16]  Ronald L. Graham,et al.  Combinatorial designs related to the strong perfect graph conjecture , 1979, Discret. Math..

[17]  M. Padberg.  Almost integral polyhedra related to certain combinatorial optimization problems , 1976 .

[18]  W. Cunningham.  Polyhedra for Composed Independence Systems , 1982 .

[19]  Manfred W. Padberg,et al.  Perfect zero–one matrices , 1974, Math. Program..