An Eberhard-like theorem for pentagons and heptagons

DOI10.1007/S00454-010-9264-1MaRDI QIDQ603874zbMATH OpenOpenAlexWikidataFDO

Authors Matt DeVos, Bojan Mohar, Robert Šámal, Agelos Georgakopoulos

Publication date 8 November 2010

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

Full work available at URL https://arxiv.org/abs/0905.3504

zbMATH Keywords

planar graphface-widthsimple polyhedronEberhard theorem

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Special sequences and polynomials (11B83) Characteristic classes and numbers in differential topology (57R20)

Abstract: Eberhard proved that for every sequence $(p_k),3lekler,ke5,7$ of non-negative integers satisfying Euler's formula $su{m}_{kge3}(6-k)p_k=12$, there are infinitely many values $p_6$ such that there exists a simple convex polyhedron having precisely $p_k$ faces of length $k$ for every $kge3$, where $p_k=0$ if $k>r$. In this paper we prove a similar statement when non-negative integers $p_k$ are given for $3lekler$, except for $k=5$ and $k=7$. We prove that there are infinitely many values $p_5,p_7$ such that there exists a simple convex polyhedron having precisely $p_k$ faces of length $k$ for every $kge3$. %, where $p_k=0$ if $k>r$. We derive an extension to arbitrary closed surfaces, yielding maps of arbitrarily high face-width. Our proof suggests a general method for obtaining results of this kind.

Recommendations

• Eberhard-type theorems with two kinds of polygons
• Description of faces in 3-polytopes without vertices of degree from 4 to 9
• scientific article; zbMATH DE number 3988272
• New Euler relation questions for convex 3-dimensional polytopes
• On Polyhedra with Specified Types of Face

Cites work

• scientific article; zbMATH DE number 558642 (Why is no real title available?)
• 4-valent graphs
• 6-valent analogues of Eberhard's theorem
• An existence theorem for simple convex polyhedra
• Convex Polytopes
• Five-valent convex polyhedra with prescribed faces
• Graphs on surfaces
• On a conjecture by B. Grünbaum
• On face vectors and vertex vectors of convex polyhedra
• On p-vectors of 3-polytopes
• On the Toroidal Analogue of Eberhard's Theorem
• On valences of polyhedra
• Some analogues of Eberhard's theorem on convex polytopes
• The analogue of Eberhard's theorem for 4-valent graphs on the torus
• The toroidal analogue to Eberhard's theorem

Cited in

(7)

• Hyperbolic analogues of fullerenes on orientable surfaces
• scientific article; zbMATH DE number 5289504 (Why is no real title available?)
• scientific article; zbMATH DE number 3988272 (Why is no real title available?)
• On a problem of J. Zaks concerning 5-valent 3-connected planar graphs
• New Euler relation questions for convex 3-dimensional polytopes
• Eberhard-type theorems with two kinds of polygons
• scientific article; zbMATH DE number 6600891 (Why is no real title available?)

This page was built for publication: An Eberhard-like theorem for pentagons and heptagons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603874)