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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
