Abstract
We provide lower and upper bounds on the minimum size of a maximum stable set over graphs of flag spheres, as a function of the dimension of the sphere and the number of vertices. Further, we use stable sets together with graph rigidity to obtain an improved Lower Bound Theorem for the face numbers of flag spheres. We propose a graph rigidity approach to settle the Lower Bound Conjecture for flag spheres in full.
Full Text
Published Version
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