arXiv:1302.4401 [math.CO]AbstractReferencesReviewsResources
f-vectors implying vertex decomposability
Published 2013-02-18Version 1
We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J. Herzog and T. Hibi. In fact we prove a generalization of their theorem using combinatorial methods.
Journal: Discrete & Computational Geometry 49 (2013), no. 2, 296-301
Tags: journal article
Related articles: Most relevant | Search more
arXiv:2403.07316 [math.CO] (Published 2024-03-12)
Simplicial complexes with many facets are vertex decomposable
arXiv:1707.07573 [math.CO] (Published 2017-07-24)
A note on the van der Waerden complex
arXiv:1911.12791 [math.CO] (Published 2019-11-28)
Partition and Cohen-Macaulay Extenders