It, is a long standing open problem to find an explicit description of the stable set polytope of claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even no conjecture at hand today. Such a conjecture exists for the class of quasi-line graphs. This class of graphs is a proper superclass of line graphs and a proper subclass of claw-free graphs for which it is known that not all facets have 0/1 normal vectors. The Ben Rebea conjecture states that the stable set polytope of a quasi-line graph is completely described by clique-family inequalities. Chudnovsky and Seymour recently provided a decomposition result for claw-free graphs and proved that the Ben Rebea conjecture holds, if the quasi-line graph is not a fuzzy circular interval graph. In this paper, we give a proof of the Ben Rebea conjecture by showing that it also holds for fuzzy circular interval graphs. Our result builds upon an algorithm of Bartholdi, Orlin and Ratliff which is concerned with integer programs defined by circular ones matrices.

Eisenbrand, F., Oriolo, G., Stauffer, G., Ventura, P. (2008). The stable set polytope of quasi-line graphs. COMBINATORICA, 28(1), 45-67 [10.1007/s00493-008-2244-x].

The stable set polytope of quasi-line graphs

ORIOLO, GIANPAOLO;
2008-01-01

Abstract

It, is a long standing open problem to find an explicit description of the stable set polytope of claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even no conjecture at hand today. Such a conjecture exists for the class of quasi-line graphs. This class of graphs is a proper superclass of line graphs and a proper subclass of claw-free graphs for which it is known that not all facets have 0/1 normal vectors. The Ben Rebea conjecture states that the stable set polytope of a quasi-line graph is completely described by clique-family inequalities. Chudnovsky and Seymour recently provided a decomposition result for claw-free graphs and proved that the Ben Rebea conjecture holds, if the quasi-line graph is not a fuzzy circular interval graph. In this paper, we give a proof of the Ben Rebea conjecture by showing that it also holds for fuzzy circular interval graphs. Our result builds upon an algorithm of Bartholdi, Orlin and Ratliff which is concerned with integer programs defined by circular ones matrices.
2008
Pubblicato
Rilevanza internazionale
Articolo
Sì, ma tipo non specificato
Settore MAT/09 - RICERCA OPERATIVA
English
CLAW-FREE GRAPHS; COMBINATORIAL OPTIMIZATION; RANK FACETS; ALGORITHM; INEQUALITIES; POLYHEDRON
Eisenbrand, F., Oriolo, G., Stauffer, G., Ventura, P. (2008). The stable set polytope of quasi-line graphs. COMBINATORICA, 28(1), 45-67 [10.1007/s00493-008-2244-x].
Eisenbrand, F; Oriolo, G; Stauffer, G; Ventura, P
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
paper2 copy.pdf

accesso aperto

Dimensione 342.44 kB
Formato Adobe PDF
342.44 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/39097
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 36
social impact