Some analogues of Eberhard's theorem on convex polytopes

DOI10.1007/BF02771220zbMath0174.53702OpenAlexW2330266085MaRDI QIDQ2532781

Branko Grünbaum

Publication date: 1969

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

Full work available at URL: https://doi.org/10.1007/bf02771220

zbMATH Keywords

metric geometry, convex geometry, integral geometry

Related Items (24)

Realizations with a cut-through Eulerian circuit ⋮ An algorithm for the characterization of the nonplanarity of a maximal graphical partition ⋮ Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face ⋮ Unnamed Item ⋮ Polytopes, graphs, and complexes ⋮ An Eberhard-like theorem for pentagons and heptagons ⋮ There is no triangulation of the torus with vertex degrees \(5, 6, \dots , 6, 7\) and related results: geometric proofs for combinatorial theorems ⋮ Constructing certain families of 3‐polytopal graphs ⋮ Cohomological rigidity of manifolds defined by 3-dimensional polytopes ⋮ Complementary regions of knot and link diagrams ⋮ Unnamed Item ⋮ On face vectors and vertex vectors of convex polyhedra ⋮ 6-valent analogues of Eberhard's theorem ⋮ The existence of certain planar maps ⋮ Über 3-realisierbare Folgen mit beliebigen Sechseckzahlen ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An existence theorem for simple convex polyhedra ⋮ On the number of hexagons in a map ⋮ The analogue of Eberhard's theorem for 4-valent graphs on the torus ⋮ On realizing symmetric 3-polytopes ⋮ Regular-faced convex polyhedra ⋮ On a problem of J. Zaks concerning 5-valent 3-connected planar graphs ⋮ Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• On p-vectors of 3-polytopes
• Properties of planar graphs with uniform vertex and face structure.
• The Number of Hexagons and the Simplicity of Geodesics on Certain Polyhedra

This page was built for publication: Some analogues of Eberhard's theorem on convex polytopes