An Eberhard-like theorem for pentagons and heptagons

DOI10.1007/S00454-010-9264-1zbMATH Open1237.52011arXiv0905.3504OpenAlexW2023680143WikidataQ105342801 ScholiaQ105342801MaRDI QIDQ603874FDOQ603874

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

Publication date: 8 November 2010

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

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.

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

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

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)

Cites Work

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

Cited In (7)

• Title not available (Why is that?)
• Hyperbolic analogues of fullerenes on orientable surfaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Eberhard-type theorems with two kinds of polygons
• New Euler relation questions for convex 3-dimensional polytopes
• On a problem of J. Zaks concerning 5-valent 3-connected planar graphs

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)