AbstractAn n-dimensional (convex) polytope is said to have few vertices if their number does not exceed n + 3. Similarly, a simplicial n-sphere with few vertices would not contain more than n + 4 of them. We want to show that all such spheres are realizable as boundary complexes of polytopes
AbstractA simplicial complex C on a d-dimensional configuration of n points is k-regular if its face...
Let K be a combinatorial (d−1)-sphere with vertices colored in n colors, n ≥ d+1. We prove that K bo...
AbstractLet K be a combinatorial (d−1)-sphere with vertices colored in n colors, n≥d+1. We prove tha...
AbstractAn n-dimensional (convex) polytope is said to have few vertices if their number does not exc...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
By a triangulated n-manifold we shall mean a simplicial complex whose body is a compact connected me...
AbstractGiven a convex n-gon P in R2 with vertices in general position, it is well known that the si...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
We introduce the non-pure versions of simplicial balls and spheres with minimum number of vertices. ...
AbstractIt is proved that every combinatorial 3-manifold with at most eight vertices is a combinator...
AbstractWE SHOW that a d-manifold M with less than 3⌈d2⌉+3 vertices is a sphere and that a d-manifol...
Abstract. We introduce the non-pure versions of simplicial balls and spheres with minimum number of ...
AbstractA complete classification is given for non-neighborly combinatorial 3-manifolds with nine ve...
AbstractConsider a polygon P and all neighboring circles (circles going through three consecutive ve...
Abstract: A simplicial complex C on a d-dimensional configuration of n points is k-regular if its fa...
AbstractA simplicial complex C on a d-dimensional configuration of n points is k-regular if its face...
Let K be a combinatorial (d−1)-sphere with vertices colored in n colors, n ≥ d+1. We prove that K bo...
AbstractLet K be a combinatorial (d−1)-sphere with vertices colored in n colors, n≥d+1. We prove tha...
AbstractAn n-dimensional (convex) polytope is said to have few vertices if their number does not exc...
AbstractAs shown by D. Barnette (1973, J. Combin. Theory Ser. A14, 37–53) there are precisely 39 sim...
By a triangulated n-manifold we shall mean a simplicial complex whose body is a compact connected me...
AbstractGiven a convex n-gon P in R2 with vertices in general position, it is well known that the si...
In this paper, we treat the decision problem of constructibility. This problem was solved only under...
We introduce the non-pure versions of simplicial balls and spheres with minimum number of vertices. ...
AbstractIt is proved that every combinatorial 3-manifold with at most eight vertices is a combinator...
AbstractWE SHOW that a d-manifold M with less than 3⌈d2⌉+3 vertices is a sphere and that a d-manifol...
Abstract. We introduce the non-pure versions of simplicial balls and spheres with minimum number of ...
AbstractA complete classification is given for non-neighborly combinatorial 3-manifolds with nine ve...
AbstractConsider a polygon P and all neighboring circles (circles going through three consecutive ve...
Abstract: A simplicial complex C on a d-dimensional configuration of n points is k-regular if its fa...
AbstractA simplicial complex C on a d-dimensional configuration of n points is k-regular if its face...
Let K be a combinatorial (d−1)-sphere with vertices colored in n colors, n ≥ d+1. We prove that K bo...
AbstractLet K be a combinatorial (d−1)-sphere with vertices colored in n colors, n≥d+1. We prove tha...
DOI
Add to ORKG