scholarly journals General cut-generating procedures for the stable set polytope

2018 ◽  
Vol 245 ◽  
pp. 28-41 ◽  
Author(s):  
Ricardo C. Corrêa ◽  
Diego Delle Donne ◽  
Ivo Koch ◽  
Javier Marenco
Keyword(s):  
Stable Set ◽  
Stable Set Polytope

scholarly journals Clique-circulants and the stable set polytope of fuzzy circular interval graphs

2007 ◽  
Vol 115 (2) ◽  
pp. 291-317 ◽  
Author(s):  
Gianpaolo Oriolo ◽  
Gautier Stauffer
Keyword(s):  
Interval Graphs ◽  
Stable Set ◽  
Stable Set Polytope

A Strengthened General Cut-Generating Procedure for the Stable Set Polytope

2015 ◽  
Vol 50 ◽  
pp. 261-266 ◽  
Author(s):  
Ricardo C. Corrêa ◽  
Javier Marenco ◽  
Diego Delle Donne ◽  
Ivo Koch
Keyword(s):  
Stable Set ◽  
Stable Set Polytope

scholarly journals On the b-Stable Set Polytope of Graphs without Bad K4

2003 ◽  
Vol 16 (3) ◽  
pp. 511-516 ◽  
Author(s):  
Dion Gijswijt ◽  
Alexander Schrijver
Keyword(s):  
Stable Set ◽  
Stable Set Polytope

On the Chvátal rank of linear relaxations of the stable set polytope

2010 ◽  
Vol 17 (6) ◽  
pp. 827-849 ◽  
Author(s):  
Eugenia Holm ◽  
Luis M. Torres ◽  
Annegret K. Wagler
Keyword(s):  
Stable Set ◽  
Stable Set Polytope ◽  
Linear Relaxations

scholarly journals The stable set polytope of quasi-line graphs

COMBINATORICA ◽  
2008 ◽  
Vol 28 (1) ◽  
pp. 45-67 ◽  
Author(s):  
Friedrich Eisenbrand ◽  
Gianpaolo Oriolo ◽  
Gautier Stauffer ◽  
Paolo Ventura
Keyword(s):  
Stable Set ◽  
Line Graphs ◽  
Stable Set Polytope

scholarly journals The Turán Polytope

10.37236/6555 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Annie Raymond
Keyword(s):  
Integer Program ◽  
Stable Set ◽  
Uniform Hypergraph ◽  
Stable Set Polytope ◽  
Turan's Theorem ◽  
Turán’S Theorem ◽  
Clique Inequalities ◽  
The Web

The Turán hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in Turán's theorem. However, when $r\ge 3$, the problem remains open. We model the problem as an integer program and call the underlying polytope the Turán polytope. We draw parallels between the latter and the stable set polytope: we show that generalized and transformed versions of the web and wheel inequalities are also facet-defining for the Turán polytope. We also show that clique inequalities and what we call doubling inequalities are facet-defining when $r=2$. These facets lead to a simple new polyhedral proof of Turán's theorem.

Sign in / Sign up

Export Citation Format

Share Document