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 -decomposability for pure simplicial complexes. They showed the diameter of a weakly -decomposable simplicial complex is bounded above by a polynomial function of the number of -faces in 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}
}