Abstract
Webs and antiwebs are natural generalizations of odd holes and odd antiholes with circular symmetry of their maximum cliques and stable sets. Webs and antiwebs turned out to play a crucial role for describing the stable set polytopes for larger graph classes. In this short note we obtain, with the help of a result of Shepherd (1995), a complete description of the stable set polytopes for antiwebs showing that antiwebs are rank-perfect.
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 callMore From: Quarterly Journal of the Belgian, French and Italian Operations Research Societies
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
