Convex polytopes without triangular faces

DOI10.1007/BF02811879zbMath0719.52009MaRDI QIDQ2640145

Roswitha Blind, Gerd Blind

Publication date: 1990

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

convex polytopecubecombinatorial typenumber of d-dimensional faces

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11)

Related Items

Gaps in the numbers of vertices of cubical polytopes. I ⋮ The cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) vertices ⋮ On low-dimensional faces that high-dimensional polytopes must have ⋮ Neighborly cubical spheres and a cubical lower bound conjecture ⋮ A new cubical \(h\)-vector ⋮ Lower bounds for cubical pseudomanifolds ⋮ The lower and upper bound problems for cubical polytopes ⋮ Triangle-free polytopes with few facets

Cites Work

• Über die minimalen Seitenzahlen von Polytopen ohne dreieckige 2-Seiten
• Puzzles and polytope isomorphisms
• A simple way to tell a simple polytope from its graph
• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen
• The minimum number of vertices of a simple polytope
• A proof of the lower bound conjecture for convex polytopes
• Shellable Decompositions of Cells and Spheres.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Convex polytopes without triangular faces