Inner diagonals of convex polytopes

DOI10.1006/jcta.1998.2953zbMath0948.52003OpenAlexW2038801915MaRDI QIDQ1296758

Victor Klee, David Bremner

Publication date: 12 November 2000

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0621420cd2d9633e8a7877b217dc3d36b65b3919

zbMATH Keywords

convex polytopewedgesimple polytope3-polytopesimplicial polytopecombinatorial type\(d\)-polytope\(i\)-diagonal\(p\)-vectorestranged vertex-pairsinner diagonal

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11)

Related Items

THE BOUNDARY VOLUME OF A LATTICE POLYTOPE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rigidity and the lower bound theorem. I
• An existence theorem for simple convex polyhedra
• An inequality for 3-polytopes
• Generic \(4\times 4\) two person games have at most 15 Nash equilibria
• New maximal numbers of equilibria in bimatrix games
• On the maximal number of Nash equilibria in an \(n\times n\) bimatrix game
• Generating rooted triangulations without repetitions
• Some semicontinuity theorems for convex polytopes and cell-complexes
• A proof of the lower bound conjecture for convex polytopes
• Infinitesimally Rigid Polyhedra. I. Statics of Frameworks
• On the Number of Vertices of a Convex Polytope
• An enumeration of simplicial 4-polytopes with 8 vertices
• On Polyhedral Realizability of Certain Sequences
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra
• Inner illumination of convex polytopes
• Inner illumination of convex polytopes