A graph is h-perfect if its stable set polytope can be completely described by nonnegativity, clique and odd-hole constraints. It is t-perfect if it furthermore has no clique of size 4.For every graph G and every c ∈ Z V (G) + , the weighted chromatic number of (G, c) is the minimum cardinality of a multi-set F of stable sets of G such that every v ∈ V (G) belongs to at least cv members of F.We prove that every h-perfect line-graph and every t-perfect claw-free graph G has the integer round-up property for the chromatic number: for every non-negative integer weight c on the vertices of G, the weighted chromatic number of (G, c) can be obtained by rounding up its fractional relaxation. In other words, the stable set polytope of G has the integer decomposition property.Another occurrence of this property was recently obtained by Eisenbrand and Niemeier for fuzzy circular interval graphs (extending previous results of Niessen, Kind and Gijswijt). These graphs form another proper subclass of claw-free graphs.Our results imply the existence of a polynomial-time algorithm which computes the weighted chromatic number of t-perfect claw-free graphs and h-perfect line-graphs. Finally, they yield a new case of a conjecture of Goldberg and Seymour on edge-colorings.
Let S ⊆ {0, 1} n and R be any polytope contained in [0, 1] n with R ∩ {0, 1} n = S. We prove that R has bounded Chvátal-Gomory rank (CG-rank) provided that S has bounded notch and bounded gap, where the notch is the minimum integer p such that all p-dimensional faces of the 0/1-cube have a nonempty intersection with S, and the gap is a measure of the size of the facet coefficients of conv(S).Let H[S] denote the subgraph of the n-cube induced by the vertices not in S. We prove that if H[S] does not contain a subdivision of a large complete graph, then both the notch and the gap are bounded. By our main result, this implies that the CG-rank of R is bounded as a function of the treewidth of H [S]. We also prove that if S has notch 3, then the CG-rank of R is always bounded. Both results generalize a recent theorem of Cornuéjols and Lee [7], who proved that the CG-rank is bounded by a constant if the treewidth of H[S] is at most 2.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.