Abstract
In 1965 Edmonds gave the first complete polyhedral description for a combinatorial optimization problem: the Matching polytope. Many researchers tried to generalize his result by considering the Stable Set polytope of claw-free graphs. However this is still an open problem. Here we solve it for the class of claw-free graphs with stability number greater than 3 and without 1-joins.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Chudnovsky and P. Seymour. Claw-free graphs V: Global structure. J. Comb. Th. B, 98:1373–1410, 2008.
V. Chv´atal. On certain polytopes associated with graphs. J. Comb. Th. B, 18:138–154, 1975.
J. Edmonds. Maximum matching and a polyhedron with 0,1 vertices. J. Res. of Nat. Bureau of Stand. B, 69B:125–130, 1965.
F. Eisenbrand, G. Oriolo, G. Stauffer, and P. Ventura. The stable set polytope of quasi-line graphs. Combinatorica, 28(1):45–67, 2008.
A. Galluccio, C. Gentile, and P. Ventura. Gear composition and the stable set polytope. Operations Research Letters, 36:419–423, 2008.
— Gear composition of stable set polytopes and G -perfection. Mathematics of Operations Research, 34:813–836, 2009.
— 2-clique-bond of stable set polyhedra. Tech. Rep. 09-10, IASI - CNR, 2009. Submitted.
— The stable set polytope of claw-free graphs with large stability number I: Fuzzy antihat graphs are W -perfect. Tech. Rep. 10-06, IASI - CNR, 2010. Submitted.
— The stable set polytope of claw-free graphs with large stability number II: Striped graphs are G -perfect. Tech. Rep. 10-07, IASI - CNR, 2010. Submitted.
A. Galluccio and A. Sassano. The rank facets of the stable set polytope for claw-free graphs. J. Comb. Th. B, 69:1–38, 1997.
R. Giles and L.E. Trotter. On stable set polyhedra for K1,3-free graphs. J. Comb. Th. B, 31:313–326, 1981.
G. Oriolo. Clique family inequalities for the stable set polytope for quasi-line graphs. Discrete Applied Mathematics, 132:185–201, 2003.
A. Pˆecher, P. Pesneau, and A. Wagler. On facets of stable set polytope of claw-free graphs with maximum stable set size three. Elec. Notes in Discrete Mathematics, 28:185–190, 2006.
A. Schrijver. Combinatorial optimization. Springer Verlag, Berlin, 2003.
B. Shepherd. Near-perfect matrices. Mathematical Programming, 64:295–323, 1994.
G. Stauffer. On the stable set polytope of claw-free graphs. PhD thesis, EPF Lausanne, 2005.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Galluccio, A., Gentile, C., Ventura, P. (2012). The stable set polytope of claw-free graphs with stability number greater than three. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-29210-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29209-5
Online ISBN: 978-3-642-29210-1
eBook Packages: Business and EconomicsBusiness and Management (R0)