No label defined (Q4263563)

This paper gives upper bounds for the Betti numbers of shellable simplicial complexes with a given number of vertices and facets, and of the boundary complex of simplicial polytopes that admit a shellable triangulation with no interior vertices. In the first case the upper bound is tight and it is reached by the so-called \((d-1)\)-trees (they are generalizations of stacked polytopes). These bounds are of current interest due to a result of Terai that says that for \(3\)-polytopes with a given number of vertices the boundary complex of a stacked polytope has the maximal Betti numbers. Notice for example that the second bound can be sharpened by finding shellable triangulations that use very few simplices. For the entire collection see [Zbl 0913.00044].