Stable sets in flag spheres
Combinatorics
2022-04-05 v2
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 to obtain an improved Lower Bound Theorem for the face numbers of flag spheres.
Cite
@article{arxiv.2110.14394,
title = {Stable sets in flag spheres},
author = {Maria Chudnovsky and Eran Nevo},
journal= {arXiv preprint arXiv:2110.14394},
year = {2022}
}
Comments
10 pages, 2 figures, to appear at FPSAC2022. Major revision, in particular, Thm.1.3 now claims a weaker lower bound, as in v1 the proof had a gap: we wrongly claimed that a certain sum of ideals is direct. These ideals are irrelevant in the current version