The minimum number of vertices of a simple polytope
From MaRDI portal
Publication:2547377
DOI10.1007/BF02771522zbMath0221.52004MaRDI QIDQ2547377
Publication date: 1971
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items
Computing and analyzing recoverable supports for sparse reconstruction, Scribability problems for polytopes, A lower bound theorem for polytope pairs, About \(f\)-vectors of inscribed simplicial polytopes, A proof of Grünbaum's lower bound conjecture for general polytopes, McMullen's conditions and some lower bounds for general convex polytopes, Lower-bound theorems for pseudomanifolds, Large-field inflation with multiple axions and the weak gravity conjecture, Small $f$-vectors of 3-spheres and of 4-polytopes, The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices, Convex polytopes without triangular faces, On the generalized lower bound conjecture for polytopes and spheres, P.L.-spheres, convex polytopes, and stress, \(f\)-vectors of 3-polytopes symmetric under rotations and rotary reflections, On the Number of Vertices of Random Polyhedra with a Given Number of Facets, A generalized lower‐bound conjecture for simplicial polytopes, A characterization of simplicial polytopes with \(g_{2}=1\), ON THE DIMENSIONS OF THE REALIZATION SPACES OF POLYTOPES, A characterization of normal 3-pseudomanifolds with at most two singularities, Lower bound theorems for general polytopes, Edge connectivity of simplicial polytopes, A FLAG VECTOR OF A 3‐SPHERE THAT IS NOT THE FLAG VECTOR OF A 4‐POLYTOPE, A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes, The number of faces of polytope pairs and unbounded polyhedra, The enumeration of stack polytopes and simplicial clusters, Tight combinatorial manifolds and graded Betti numbers, How many simplices are needed to triangulate a Grassmannian?, On \(r\)-stacked triangulated manifolds, Cubulations, immersions, mappability and a problem of habegger, Rigidity and the lower bound theorem for doubly Cohen-Macaulay complexes, The lower and upper bound problems for cubical polytopes, Graph theorems for manifolds, Polytope pairs and their relationship to linear programming, Normal surfaces as combinatorial slicings, Rigidity and the lower bound theorem. I, The dimension of almost spherical sections of convex bodies, Unnamed Item, Almost Simplicial Polytopes: The Lower and Upper Bound Theorems, Enumeration of lattice polytopes by their volume, On the no-signaling approach to quantum nonlocality, Points surrounding the origin, Über die minimalen Seitenzahlen von Polytopen ohne dreieckige 2-Seiten, Triangle-free polytopes with few facets
Cites Work
