Gaps in the numbers of vertices of cubical polytopes. I

DOI10.1007/BF02574013zbMath0807.52009MaRDI QIDQ1327456

Roswitha Blind, Gerd Blind

Publication date: 19 June 1994

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131306

zbMATH Keywords

number of verticescubical \(d\)-polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Related Items

The cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) vertices, Bipartite Rigidity, Additive structures on \(f\)-vector sets of polytopes, A new cubical \(h\)-vector, Cubulations, immersions, mappability and a problem of habegger, Construction Techniques for Cubical Complexes, Odd Cubical 4-Polytopes, and Prescribed Dual Manifolds, Bipartite rigidity, Eulerian 2-strata spaces, Semi-algebraic sets of \(f\)-vectors

Cites Work

• The lower and upper bound problems for cubical polytopes
• Convex polytopes without triangular faces
• Shellable Decompositions of Cells and Spheres.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item