Abstract
While the Ben Rebea Theorem provides a complete linear description of the stable set polytope of quasi-line graphs, no minimal description is currently available. In this paper, we shed some light on this question by (1) showing that any facet of this polytope is such that the restriction of the inequality to maximal coefficients yields a rank facet and (2) providing a complete description of the strongly minimal facets. We also show that those results support two conjectures refining the Ben Rebea Theorem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.