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

Arnaud Pecher (1, 2) , Annegret K. Wagler (3)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
3 IMO - Institute for Mathematical Optimization

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

Domaines: Autre [cs.OH]

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