It seems to be a fact that there are only five bounded connected non-selfintersecting polyhedra with identical regular-polygon faces and congruent vertices (i.e., you can pick a neighborhood of every vertex so that all the neighborhoods are congruent, this is sometimes called "locally vertex-transitive"), namely the platonic solids.

(Drop any one word in the above and you get more: unbounded allows an infinite linear chain of octahedra glued face to face; disconnected allows the union of two disjoint Platonic solids; self-intersecting allows two of the Kepler-Poinsot solids; non-identical allows Archimedean solids; irregular faces allows e.g. the noble disphenoid, and of course dropping congruent vertices allows a myriad of possibilities.) Note I have not included convex among the hypotheses.

However, I am hard-pressed to put together a proof of this. If you add the hypothesis that the polyhedron is genus 0, then Euler's formula shows you there must be an overall angle defect, so the same angle defect at each vertex since the vertices are congruent, and now you can do the usual three times the vertex angle must be less than a full circle, etc. (Even in the case of genus 1, Euler's formula just tells you that the angle sum must be 0 at each vertex, and then there are infinite solutions for both six triangles and four squares at each vertex -- basically infinitely long prisms, which are projectively speaking tori -- so you will really need to use the boundedness...)

Nevertheless, the genus-zero hypothesis doesn't seem to be necessary; there seem to be no higher-genus connected bounded non-selfintersecting polyhedra with identical regular-polygon faces and congruent vertices. Can anyone outline or point me to a proof of this fact?

  • 1
    $\begingroup$ For another reason that it seems to me that the proof of this will have to carefully use the geometry of regular polygons, see figure 8 in arxiv.org/pdf/1502.07497.pdf -- it is a polyhedron that is bounded, non-selfintersecting, and vertex-transitive (so certainly the vertices are all congruent). The only thing it is missing is regular faces. $\endgroup$ Sep 20, 2018 at 23:47
  • 1
    $\begingroup$ @M.Winter, the statement is just based on lore: the observation that nobody lists any such polyhedra in any of the catalogs of regular(-ish) polyhedra leads me to believe that they don't exist. We are literally talking about an area that has been studied for 2500 years. If there were any, they would have been discovered and be well-known. But that's precisely why I would love to know the proof that they don't exist; someone must have done it. Perhaps I should ask this on MathOverflow? $\endgroup$ Apr 23, 2020 at 0:59
  • 1
    $\begingroup$ Anyway, there are probably none. Regular "figures" of higher genus are usually studied as regular tilings of the Euclidean or hyperbolic plane, and there are many. In particular, they are combinatorially feasible. It just involves a geometric argument, that these cannot be embedded into 3-space. $\endgroup$
    – M. Winter
    Apr 23, 2020 at 8:40
  • 1
    $\begingroup$ Thanks for the discussion. Have edited the last paragraph of the question accordingly. And if you have a good reference for "higher-genus vertex-transitive polyhedra ... found very recently" especially detailing what's still to be determined, that would be of great interest to me. $\endgroup$ Apr 25, 2020 at 17:58
  • 1
    $\begingroup$ Here is the latest reference, mentioning all the previous results and open questions: U. Leopold, "Vertex-Transitive Polyhedra of Higher Genus, I". $\endgroup$
    – M. Winter
    Apr 25, 2020 at 22:35

3 Answers 3


Here is one reference where the author does not assume genus 0: He gives careful definitions and proofs:

Cromwell, Peter R., Polyhedra., Cambridge: Cambridge University Press. xiii, 451 p. (1999). ZBL0926.52014.

In Chapter 10 he gives a complete classification of embedded polyhedral surfaces $S$ in $E^3$ which are closed (compact, without boundary) and connected as topological surfaces and satisfy:

  1. Each face is a regular convex polygon and all faces are congruent.

  2. Links of any two vertices are congruent. (In other words, for any two vertices $v, w$ of $S$ there are neighborhoods of these vertices in $S$ which are congruent in $E^3$.)

  3. All dihedral angles are equal. (Not sure if this is an independent condition.)

All regular polyhedra listed by Cromwell have genus zero.

Edit. I do not have an answer to your precise question: The assumption that Cromwell makes about equality of all dihedral angles forces $S$ to be locally convex, hence, convex. However, with a bit stronger assumption than the one you make, your question does have positive answer:

Theorem. Suppose that $S$ is a uniform (embedded) connected closed polyhedral surface in $E^3$, i.e. such that:

a. All faces of $S$ are regular polygons.

b. The symmetry group of $S$ acts transitively on the set of vertices of $S$.


  1. $S$ is simply-connected.

  2. If, in addition, all faces of $S$ are congruent to each other, then $S$ is the boundary of one of the Platonic solids.

Remark. A symmetry of $S$ is an isometry of $E^3$ which preserves $S$.

A classification of all uniform polyhedral surfaces (with references) can be found in this Wikipedia article (which also allows for non-embedded surfaces). The conclusion of the theorem stated above comes from examination of the list. The references for completeness of the list are:

  1. S. P. Sopov, "A proof of the completeness on the list of elementary homogeneous polyhedra", Ukrainskiĭ Geometricheskiĭ Sbornik (8) (1970) 139–156.

  2. J. Skilling, "The complete set of uniform polyhedra", Philosophical Transactions of the Royal Society of London, 278 (1975) 111–135

However, in your question instead of vertex-transitivity of the group of symmetries you only assume local transitivity:

For any two vertices $v, w$ of $S$ there exist neighborhoods $U_v, U_w$ of $v, w$ in $S$ and an isometry $g\in Isom(E^3)$ which carries $U_v$ to $U_w$.

This is a weaker assumption than vertex-transitivity and I am not sure it suffices for the desired conclusion (even assuming, in addition, that $S$ has genus 0).

Definition. A (closed, connected, embedded) polyhedral surface in $E^3$ is called pseudo-uniform if its faces are regular polygons and $S$ is locally vertex-transitive but not vertex-transitive.

They are discussed in this Wikipedia article:

There are two known pseudo-uniform polyhedra: the pseudorhombicuboctahedron and the pseudo-great rhombicuboctahedron. It is not known if there are any others; Branko Grünbaum conjectured that there are not, but thought that a proof would be "probably quite complicated".

The first of these two surfaces is convex but its faces are squares and triangles, hence, they are not all congruent. The second surface is not embedded (and, again, has non-congruent faces). As far as I can tell, Grunbaum's conjecture is still open. If true, it will imply the positive answer to your question. However, clearly, his conjecture is harder since he does not assume congruence of all faces.


Gillispie, Steven B.; Grünbaum, Branko, The ({4,5}) isogonal sponges on the cubic lattice, Electron. J. Comb. 16, No. 1, Research Paper R22, 28 p. (2009). ZBL1160.52011.

the authors define Platonic polyhedra as those which are locally vertex-transitive and have regular and congruent faces. They make no comments about the classification about such polyhedra (apart from the classical case of convex polyhedra). Using their terminology, your question can be formulated as:

Suppose that $S$ is a closed connected polyhedral surface in $E^3$ which is a Platonic polyhedron. Is it true that $S$ is convex?

Considering surfaces of genus $1$, it is easy to see that the only examples can occur when faces are triangles and all vertices are 6-valent; it is a polyhedron of type $P(3,6)$ in the standard terminology. For each vertex, up to congruence, there is a 3-dimensional family of deformations in $E^3$ of the star of the vertex...

  • $\begingroup$ Thje third condition about the dihedral angles is exactly the assumption about "regular vertex figures" that is usually assumed for regular polyhedra, but that is missing here. I wonder what happens when we drop it. $\endgroup$
    – M. Winter
    Apr 25, 2020 at 22:43
  • $\begingroup$ @M.Winter: Right. It is hard to nail down references, but, by an overkill, one can consider "uniform polyhedra" which have regular faces and vertex-transitive symmetry group. They are classified according to this wikipedia article and all have genus 0. But there should be a simpler proof assuming that faces are congruent. $\endgroup$ Apr 25, 2020 at 22:56
  • 1
    $\begingroup$ Thank you so much! Your response is now crystal clear, and it exposes exactly the crux of my question -- I have been seeking the weakest hypotheses that characterize the platonic solids, and the weakest that I have formulated that appear to work are the ones stated in the question. Do they actually suffice? Perhaps I should cross-post the question, with this level of specificity and clarity, to math overflow? Oh, and I am pretty sure that if you add genus 0 to my hypotheses it's not hard to prove that you get only the Platonic solids. $\endgroup$ Apr 26, 2020 at 19:27
  • 1
    $\begingroup$ @GlenWhitney: I added one more remark which, hopefully, makes it easier to search for references. Yes, posting on MO sounds like a good idea. Just do not call such surfaces regular. The correct technical name is "uniform or pseudo-uniform, with congruent faces." $\endgroup$ Apr 26, 2020 at 19:37
  • 1
    $\begingroup$ This is a great answer with great references, which makes it plausible to assume that this question might be open (surprisingly)! In my opinion, this is the answer that should be accepted. $\endgroup$
    – M. Winter
    Apr 27, 2020 at 9:31

The problem is of geometric nature. There are indeed combinatorially feasible regular "figures" with higher genus, usually considered as tilings of the Euclidean or hyperbolic plane. So the question is why these cannot be realized as geometry objects in $\Bbb R^3$.

I will outline an approach that additionally assumes that all vertex-figures are regular polygons as well (something usually considerde when discussing regular polyhedra). The shape of a regular polyhedron (in your more general sense) is completely determined by two numbers $p,q\ge 3$, so that at each vertex meet $q$ regular $p$-gons.

It is a classical result, that for $1/p+1/q>1/2$, one obtains a convex regular polyhedron. In the case $1/p+1/q=1/2$, the vertex neighborhood becomes "flat", and since it is flat at every vertex, it can never close to a bounded object.

There is a more general argument that shows that $1/p+1/q\le 1/2$ is not possible. It can be shown that because the regular polyhedron is build in such a uniform way (all vertices look the same, all faces too), that it is in fact vertex-transitive, that is, each vertex can be mapped to any other one by a symmetry of the polyhedron. For a bounded object these symmetries cannot involve translation, but only orthogonal transformation (assuming that the polyhedron is centered around the origin). But then, all vertices must lie on a common sphere. Hopefully it becomes clear from above picture, that this is not possible if we try to arrange too many faces around a vertex. And "too many" coincides exactly with $1/p+1/q\le 1/2$.

All this can be made precise, but it takes some care and sometimes tricky geometric arguments which are easier understood by visual inspection (e.g. to show that no such sphere exists).

  • $\begingroup$ I am unconvinced by your argument even in the flat case: An intrinsically flat polyhedral surface need not be extrinsically flat. $\endgroup$ Apr 25, 2020 at 18:22
  • $\begingroup$ Do you have a reference for your "it can be shown that ... it is vertex-transitive"? I would very interested to read, and presumably it would help dispel @MoisheKohan's concerns... $\endgroup$ Apr 25, 2020 at 19:15
  • $\begingroup$ @MoisheKohan The statement $1/p+1/q=1/2$ is not about intrinsic flatness, but is just a rearrangement of the fact that the interior angles of $q$ regular $p$-gons add up to exactly $2\pi$. Such an arrangement must be geometrically flat. Think about arranging four squares around a vertex. There is a single way to do so, and its the "flat way". Anyway, I should update my answer as there seem to be open questions. $\endgroup$
    – M. Winter
    Apr 25, 2020 at 22:11
  • $\begingroup$ @M.Winter: What you wrote is just false, that was the point of my comment. "Think about arranging four squares around a vertex. There is a single way to do so, and its the "flat way"." is just false. It is true if you were to use three corners (with the angle sum $2\pi$) but is false for the higher number of corners. In other words, intrinsic flatness does not imply extrinsic flatness. $\endgroup$ Apr 25, 2020 at 22:20
  • $\begingroup$ @MoisheKohan I see what you mean. I assumed some kind of regularity of the vertex figures too. Something which is usually assumed for regular polyhedra. Anyway, OP has explicitly not mentioned this and so I have to rework or delete my answer. $\endgroup$
    – M. Winter
    Apr 25, 2020 at 22:22

I like the graph theory based argument. Let's talk about a simplicial 2-complex (hence complex) with $V$ vertices, $E$ edges, and $F$ faces, all greater than 0. A complex is regular if all vertices have the same degree $p$ and all faces have the same degree $q$ (here a face's degree is the number of edges--or 1-simplices--on its boundary). We won't allow degenerate faces, or faces whose degree is 2, so $q \geq 3$. We also don't want to allow a vertex next to only two faces, so $p \geq 3$.

Also, by the handshaking lemma, $2E = pV$ and $2E = qF$, or $V=\frac{2E}{p}$ and $F = \frac{2E}{q}$.

Euler's theorem is that $V - E + F = \chi$, which after substituion from above becomes

$$\frac{2E}{p} - E + \frac{2E}{q} = \chi$$ $$\Rightarrow \frac{1}{p} + \frac{1}{q} = \frac{1}{2} + \frac{\chi}{2E}$$

We now consider what integer values of $p\geq 3$ and $q \geq 3$ can satisfy this equation.

First look at the case where $\chi = 2$ (the sphere). In this case, we have that

$$\frac{1}{p} + \frac{1}{q} = \frac{1}{2} + \frac{1}{E}$$

Now assume that both $p > 3$ and $q > 3$, then $\frac{1}{p} + \frac{1}{q} \leq \frac{1}{2} < \frac{1}{2} + \frac{1}{E}$ (since $E > 0$). Therefore, at least one of $p$ and $q$ is 3. Without loss of generality, if $p = 3$, and $q \geq 6$ we again arrive at a contradiction, because $\frac{1}{p} + \frac{1}{q} \leq \frac{1}{2} < \frac{1}{2} + \frac{1}{E}$. In fact, you can work out the only pairs of $(p, q)$ that work are $(3, 3)$--tetrahedron, $(3, 4)$--cube, $(4, 3)$--octahedron, $(3,5)$--dodecahedron, and $(5, 3)$--icosahedron. (I'll leave that to you to check.)

Now, let's look at the torus, $\chi = 0$. In this case we have $\frac{1}{p} + \frac{1}{q} = \frac{1}{2}$. So $p = q = 4$ and (as pointed out in the comments) $\{p, q\} = \{3, 6\}$ work. We'll need some geometry to argue that those can't be built. I think it will stem from the fact that in each case, we have exactly $2\pi$ angle around each vertex. In the case of $p = 3$ and $q = 6$, there is only one way to lay out three hexagons around an interior vertex which is for all dihedral angles to be $\pi$, which clearly leads to a contradiction.

With the higher genus tori, many more values for $p$ and $q$ may work and so the geometry is going to have to play a bigger role.

  • $\begingroup$ No, for $\chi = 0$ there are two other solutions: {p,q} = {3,6}. There are many combinatorially possible configurations for both of these and for (4,4). It's precisely these cases and the even-higher-genus cases that I am concerned about, and it seems certain that both geometry and combinatorics will come into play, as at least some of these cases correspond to perfectly valid polyhedra, that it so happens just can't be made with regular polygons. $\endgroup$ Sep 25, 2018 at 2:59
  • $\begingroup$ Ah, yes. Updating to reflect. With the higher genus it seems a purely combinatorial argument won't be enough. $\endgroup$
    – John
    Sep 25, 2018 at 23:47
  • $\begingroup$ In addition to the observation that (3,6) is out, you can rule out (4,4) because any vertex of this configuration must have two collinear edges; since all vertices are congruent, the polyhedron would then contain an entire line, i.e. be unbounded. The trickiest genus-0 case is (6,3), because there are vertex configurations with alternating dihedral angles which lie strictly in a half-space with the vertex on the boundary. So I don't know how to finish off that case, and then there are all the higher genera... $\endgroup$ Sep 26, 2018 at 3:51

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .