Abstract
We study the Lovász-Schrijver lift-and-project operator () based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of graphs. The problem of obtaining a combinatorial characterization of graphs for which the -operator generates the stable set polytope in one step has been open since 1990. We call these graphs -perfect. In the current contribution, we pursue a full combinatorial characterization of -perfect graphs and make progress towards such a characterization by establishing a new, close relationship among -perfect graphs, near-bipartite graphs and a newly introduced concept of full-support-perfect graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.