AbstractWe show that if a three-dimensional polytopal complex has a knot in its 1-skeleton, where the bridge index of the knot is larger than the number of edges of the knot, then the complex is not constructible, and hence, not shellable. As an application we settle a conjecture of Hetyei concerning the shellability of cubical barycentric subdivisions of 3-spheres. We also obtain similar bounds concluding that a 3-sphere or 3-ball is non-shellable or not vertex decomposable. These two last bounds are sharp
AbstractAn n-dimensional (convex) polytope is said to have few vertices if their number does not exc...
AbstractIn 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of sim...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
AbstractWe show that if a three-dimensional polytopal complex has a knot in its 1-skeleton, where th...
AbstractIn this paper, we treat the problem to find an efficient algorithm to decide constructibilit...
Shellability of simplicial complexes has been a useful concept in polyhedral theory, in piecewise li...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
A simplicial complex ∆ is shellable if its facets “fit nicely together”. Specifically, if there is a...
We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is shelling completab...
AbstractConstructibility is a combinatorial property of simplicial complexes. In general, it require...
AbstractWe give new examples of shellable, but not extendably shellable two-dimensional simplicial c...
The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e.,...
AbstractThe vertex stars of shellable polytopal complexes are shown to be shellable. The link of a v...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
AbstractAn n-dimensional (convex) polytope is said to have few vertices if their number does not exc...
AbstractIn 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of sim...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
AbstractWe show that if a three-dimensional polytopal complex has a knot in its 1-skeleton, where th...
AbstractIn this paper, we treat the problem to find an efficient algorithm to decide constructibilit...
Shellability of simplicial complexes has been a useful concept in polyhedral theory, in piecewise li...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
A simplicial complex ∆ is shellable if its facets “fit nicely together”. Specifically, if there is a...
We say that a pure $d$-dimensional simplicial complex $\Delta$ on $n$ vertices is shelling completab...
AbstractConstructibility is a combinatorial property of simplicial complexes. In general, it require...
AbstractWe give new examples of shellable, but not extendably shellable two-dimensional simplicial c...
The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e.,...
AbstractThe vertex stars of shellable polytopal complexes are shown to be shellable. The link of a v...
We prove that for every d >= 2, deciding if a pure, d-dimensional, simplicial complex is shellable i...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...
AbstractAn n-dimensional (convex) polytope is said to have few vertices if their number does not exc...
AbstractIn 1992, Thomas Bier introduced a surprisingly simple way to construct a large number of sim...
We prove that for every d ≥ 2, deciding if a pure, d-dimensional, simplicial complex is shellable is...