On Non-Rank Facets in Stable Set Polytopes of Webs with Clique Number Four

Arnaud Pecher 1, 2 Annegret K. Wagler 3
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : Graphs with circular symmetry, called webs, are relevant for describing the stable set polytopes of two larger graph classes, quasi-line graphs and claw-free graphs. Providing a decent linear description of the stable set polytopes of claw-free graphs is a long-standing problem. However, even the problem of finding all facets of stable set polytopes of webs is open. So far, it is only known that stable set polytopes of webs with clique number ≤ 3 have rank facets only while there are examples with clique number > 4 having non-rank facets. The aim of the present paper is to treat the remaining case with clique number =4: we provide an infinite sequence of such webs whose stable set polytopes admit non-rank facets
Document type :
Journal articles
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00307757
Contributor : Arnaud Pêcher <>
Submitted on : Tuesday, November 4, 2008 - 3:00:40 PM
Last modification on : Wednesday, February 13, 2019 - 10:32:02 AM
Long-term archiving on : Friday, October 5, 2012 - 11:27:49 AM

File

DAS01_.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00307757, version 1

Citation

Arnaud Pecher, Annegret K. Wagler. On Non-Rank Facets in Stable Set Polytopes of Webs with Clique Number Four. Discrete Applied Mathematics, Elsevier, 2006, 154, pp.1408--1415. ⟨hal-00307757⟩

Share

Metrics

Record views

233

Files downloads

170