On the b-stable set polytope of graphs without bad K 4 Dion Gijswijt , Alexander Schrijver March 23, 2005 Abstract We prove that for a graph G =(V,E) without bad K 4 subdivision, and for b Z V E + , the b-stable set polytope is determined by the system of constraints determined by the vertices, edges and odd circuits. We also prove that this system is totally dual integral. This relates to t-perfect graphs. Let G =(V,E) be a graph and let b Z V E + . Then a b-stable set in G is a vector x Z V + satisfying x v b v for every vertex v and x u + x v b uv for every edge uv. The b-stable set polytope of G is defined as the convex hull of the b-stable sets in G. We will use the following notation. For sets B A and a vector x R A , let χ B be the characteristic vector of B and let x(B) := x T χ B . For an edge {u, v} we will use the shorthand notation uv. The vectors in the b-stable set polytope obviously satisfy the following system of inequal- ities. (i) 0 x v b v for each v V ; (1) (ii) x u + x v b uv for each edge uv E; (iii) x(VC ) ≤⌊ 1 2 b(EC )for each odd circuit C. We call a graph G t-perfect with respect to b if the b-stable set polytope is determined by (1). Since each integral vector satisfying (1) is a b-stable set, the polytope determined by (1) equals the b-stable set polytope if and only if it is integral. We call a graph G strongly t-perfect with respect to b if system (1) is totally dual integral. For any weight function w Z V + and any b Z V E + , denote by α(G, b, w) the maximum w-weight w T x of a b-stable set x in G. Define a w-cover as a family of vertices, edges and odd circuits in G that covers each vertex v at least w v times. The b-cost of a w-cover is defined as the sum of the costs of its elements, where the cost of a vertex v equals b v , the cost of an edge e equals b e and the cost of an odd circuit C equals 1 2 b(EC ). Denote by Department of Mathematics, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands (gijswijt@science.uva.nl). CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, and Department of Mathematics, University of Amsterdam, Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands (lex@cwi.nl). 1