English

Not all simplicial polytopes are weakly vertex-decomposable

Combinatorics 2012-03-09 v1 Optimization and Control

Abstract

In 1980 Provan and Billera defined the notion of weak kk-decomposability for pure simplicial complexes. They showed the diameter of a weakly kk-decomposable simplicial complex Δ\Delta is bounded above by a polynomial function of the number of kk-faces in Δ\Delta and its dimension. For weakly 0-decomposable complexes, this bound is linear in the number of vertices and the dimension. In this paper we exhibit the first examples of non-weakly 0-decomposable simplicial polytopes.

Keywords

Cite

@article{arxiv.1203.1676,
  title  = {Not all simplicial polytopes are weakly vertex-decomposable},
  author = {Jesus A. De Loera and Steven Klee},
  journal= {arXiv preprint arXiv:1203.1676},
  year   = {2012}
}
R2 v1 2026-06-21T20:30:48.464Z