On the facets of the lift-and-project relaxations of graph subdivisions

We study the behavior of lift-and-project procedures for solving combinatorial optimization problems as described by Lovلsz and Schrijver (1991), in the context of the stable set problem on graphs. Following the work of Wolsey (1976), we investigate how to generate facets of the relaxations obtained by these procedures from facets of the relaxations of the original graph, after applying fundamental graph operations. We show our findings for the odd subdivision of an edge and its generalization, the stretching of a vertex operation.