Polyhedral results on the stable set problem in graphs containing even or odd pairs
Even and odd pairs are important tools in the study of perfect graphs and were instrumental in the proof of the Strong Perfect Graph Theorem. We suggest that such pairs impose a lot of structure also in arbitrary, not just perfect graphs. To this end, we show that the presence of even or odd pairs in graphs imply a special structure of the stable set polytope. In fact, we give a polyhedral characterization of even and odd pairs.
KeywordsStable set problem Stable set polytope Even pairs Odd pairs Integer programming
Mathematics Subject Classification90C10 (Integer programming) 90C27 (Combinatorial optimization) 90C57 (Polyhedral combinatorics, branch-and-bound, branch-and-cut)
- 8.Ramirez-Alfonsin, J.L., Reed, B.A. (eds.): Perfect Graphs. Wiley, Chichester, UK (2001)Google Scholar
- 9.Reed, B.: Perfection, parity, planarity, and packing paths. In: Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, pp. 407–419. University of Waterloo Press (1990)Google Scholar