English

An Eberhard-like theorem for pentagons and heptagons

Combinatorics 2010-05-07 v3

Abstract

Eberhard proved that for every sequence (pk),3kr,k5,7(p_k), 3\le k\le r, k\ne 5,7 of non-negative integers satisfying Euler's formula k3(6k)pk=12\sum_{k\ge3} (6-k) p_k = 12, there are infinitely many values p6p_6 such that there exists a simple convex polyhedron having precisely pkp_k faces of length kk for every k3k\ge3, where pk=0p_k=0 if k>rk>r. In this paper we prove a similar statement when non-negative integers pkp_k are given for 3kr3\le k\le r, except for k=5k=5 and k=7k=7. We prove that there are infinitely many values p5,p7p_5,p_7 such that there exists a simple convex polyhedron having precisely pkp_k faces of length kk for every k3k\ge3. %, where pk=0p_k=0 if k>rk>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.

Keywords

Cite

@article{arxiv.0905.3504,
  title  = {An Eberhard-like theorem for pentagons and heptagons},
  author = {Matt DeVos and Agelos Georgakopoulos and Bojan Mohar and Robert Šámal},
  journal= {arXiv preprint arXiv:0905.3504},
  year   = {2010}
}
R2 v1 2026-06-21T13:04:40.797Z