论文信息 - On a geometric property of perfect graphs

On a geometric property of perfect graphs

LetG be a graph,VP(G) its vertex packing polytope and letA(G) be obtained by reflectingVP(G) in all Cartersian coordinates. Denoting byA*(G) the set obtained similarly from the fractional vertex packing polytope, we prove that the segment connecting any two non-antipodal vertices ofA(G) is contained in the surface ofA(G) and thatG is perfect if and only ifA*(G) has a similar property.

S. Perz | Leszek S. Zaremba | L. Zaremba | S. Perz

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

[2] D. R. Fulkerson,et al. Anti-blocking polyhedra , 1972 .

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

[4] D. R. Fulkerson,et al. Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

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