An Eberhard-like theorem for pentagons and heptagons
Combinatorics
2010-05-07 v3
Abstract
Eberhard proved that for every sequence of non-negative integers satisfying Euler's formula , there are infinitely many values such that there exists a simple convex polyhedron having precisely faces of length for every , where if . In this paper we prove a similar statement when non-negative integers are given for , except for and . We prove that there are infinitely many values such that there exists a simple convex polyhedron having precisely faces of length for every . %, where if . 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}
}