Abstract
We study the stable set polytope P(Gn) for the graph Gn with n nodes and edges [i,j] with $j \in \{i+1,i+2\}$, $i=1, \ldots, n$ and where nodes n+1 and 1 (resp., n+2 and 2) are identified. This graph coincides with the antiweb $\bar{W}(n,3)$. A minimal linear system defining P(Gn) is determined. The system consists of certain rank inequalities with some number theoretic flavor. A characterization of the vertices of a natural relaxation of P(Gn) is also given.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
