## Eberhard Theorem

Consider a simple 3-polytope P, (so every vertex has 3 neighbors). If $p_k$ is the number of faces of P which are k-gonal, Euler's theorem implies that

$$(*) ~~\sum_{k \ge 3} (6-k)p_k=12.$$

Note that 6-gonal faces do not contribute to the LHS.

One way to think about it is that polygonal faces with 7 and more sides contribute "negative curvature", small faces namely triangles quadrangles and pentagons, contribute positive "curvature" and hexagons are "flat".

Eberhard's theorem asserts that if you have a sequence of numbers $p_k, k \ne 6$ such that $\sum_{k \ge 3} (6-k)p_k=12$ then you can find a simple 3-polytope with $p_k$ k-gonal faces. (But you have no control on $p_6$).

## Extensions of Eberhard theorem

There are various results extending Eberhard's theorem in various directions. Chapter 13 in Grunbaum's book "Convex Polytopes" and especially the supplemantary material at the end of the chapter in the new 2nd edition is a good source. Another general source is my chapter from the "Handbook of Discrete and Computational geometry" on garphs and skeleta of polytops.

A relatively recent paper on the subject is by Stanislav Jendrol "On the face vectors of trivalent convex polyhedra". Another paper by Jendrol which deals with general 3-polytopes from the same year is "On face vectors and vertex vectors of convex polyhedra" Discrete Math 118 (1993)119-144. There are analogs of Eberhard theorem for 4-regular planar graphs, for toroidal graphs and in other directions.

A far as I know, there is no good answer known for the question posed by Shephard of characterizing all sequences $(p_3,p_4,\dots)$, and no such characterization is known even for the simple case.

## High dimensions

In higher dimensions and even in four dimensions there are various different ways to extend these problems, these problems become very difficult and very little is known.

### 2-dimensional faces

You can ask again about the numbers of k-gonal 2-dimensional faces. While the formula above implies that in dimension 3 and more $p_3+p_4+p_5>0$ it is known that in dimensions 5 and more $p_3+p_4>0$.

### Types of facets

Perhaps an even more natural extension is to consider the type of facets a given d-simensional polytope have. You can ask for a simple 4 polytope (a 4-polytope whose graph is 4-regular) what are the number of facets $p_Q$ isomorphic to a given 3-polytope Q. This gives you a vector indexed by combinatorial types of simple 3-polytopes, but I am not aware of any Eberhard type theorem and I do not know even which 3-polytopes should be considered as the analogs of the hexagons in the above formula. Dually stated and extented to triangulations of 3-spheres the question is to associate to a triangulated 3-simensional sphere (or just simplicial 3-polytope) the list of links of vertices (with multiplicities) it has. A related MO question is this one.

### Type of facets according to their number of their facets

Rather than classifying the facets according to their full combinatorial type we can classify them according to their own number of facets. Here, for dimension greater than 4 there is no analog for (*). It is possible that under wide circumstences the numbers of facets with k facets can be prescribed, but I am not aware of results in this direction.

### Type of facets according to their f-vectors

Precscribing the entire vector of face numbers of the individual facets, may well be the most interesting extension from 3 to higher dimensions.

There are some reasons to jump from dimension 3 directly to dimension 5. The nature of the problem is different in even and odd dimensions. Let me try to elaborate on that.

Suppose you have a simple 5-polytope P and denote by $p_{a,b}$ the number of facets F so that $f_3(F)=a$ and $f_2(F)=b$. (For a polytope or some other cell complex X, $f_i(X)$ denotes the number of $i$-dimensional faces of $X$.) Dually, we can consider a triangulation $K$ of the 4-simensional sphere $S^4$ and let $p_{a,b}$ be the number of vertices whose **link** has $a$ vertices and $b$ edges.

Now the Dehn-Sommervill relations imply that

$$(**) \sum p_{a,b} (b-6a+30) = 60 .$$

So now we can consider 4 dimensional facets as "small" if b-6a+30 is negative, as "large" if $b-6a+30$ is positive, and as neutral if $b=6a-30$. An analog of Eberhard theorem will say that you can prescribe the types of small and large facets and realize the polytope (or the triangulated sphere) by allowing to add many "neutral" facets.

### Facets and non facets

A related question that was studied in several papers is: for which d-polytopes P there is a (d+1) polytopes Q such that all faces of Q are isomorphic to P. Such polytopes P are called "facets". An intriguing open problem is if the icosahedron is a facet.

### Cubical complexes

Simple polytopes are dual to simplicial polytopes, and there is some special interest in these problems for cubical complexes (or their duals). Indeed there is an analog of Eberhard's theorem for 3-polytopes with all vertex degrees 4. There should be an analog for (**) and this may be related to interesting questions about curvature of cubical complexes.

### Stacked polytopes

A stack polytope is a polytope obtained by gluing simplices along facets. (They are related to Appolonian circle packing.) Stacked polytopes are simplicial. I do not know if there is an analog of Eberhard's theorem when we consider only simple 3-polytope which are dual to stacked 3-polytopes. This is also interesting for other dimensions. All facets of stacked 5 polytopes are stacked and their number of edges is four times the number of vertices minus 10. Therefore, for a dual-to-stacked 5 polytope formula (**) reduces to $$\sum p_{a,b}(10-a)=30.$$ (Here, $b=4a-10$ so we can omit the subscript $b$.) So in this case, the distinction is between facets with $a<10$, those with $a>10$ and those with $a=10$. Again we can look for some analogs for Eberhard's theorem, which in this case, might be easier.