Euler's polyhedral formula states that for any convex polyhedron, the number of vertices minus the number of edges plus the number of faces always equals two: V − E + F = 2. A cube has 8 vertices, 12 edges and 6 faces, and 8 − 12 + 6 = 2. A tetrahedron has 4, 6 and 4, and 4 − 6 + 4 = 2. A dodecahedron has 20, 30 and 12, and the sum is two again. The relationship holds for every convex solid regardless of how irregular it is.
This polyhedron Euler calculator rearranges the formula to find whichever of the three counts you are missing, and — more usefully — checks whether a set of three counts you already have could belong to a real solid. Arb Digital built the checking mode because Euler's formula is necessary but not sufficient: passing it does not prove a polyhedron exists, and knowing which further conditions to test is where the actual work is.
What This Polyhedron Euler Calculator Does
Choose which quantity to solve for, enter the other two, and the tool returns the missing count with the rearranged formula shown. In check mode it takes all three counts and tests them against Euler's relation and three additional necessary conditions, reporting each one separately rather than issuing a single pass or fail.
The surface selector extends the formula beyond convex solids. Euler's familiar V − E + F = 2 is the genus-zero case of a more general statement: for a closed surface of genus g, the Euler characteristic is χ = 2 − 2g, and V − E + F equals that instead. A solid with one hole through it — a picture frame, a torus-shaped block — has χ = 0, so V − E + F = 0 for any polyhedral subdivision of it.
Non-integer or negative counts are rejected in words. A polyhedron cannot have 7.5 edges, and when the arithmetic implies a fractional or negative count, the tool says which input made that happen instead of printing the number.
How to Use It
- Pick what you are solving for. The corresponding input box is then ignored, so it does not matter what is left in it.
- Enter the two counts you know as whole numbers. Count each edge once even though it borders two faces, and each vertex once however many edges meet there.
- Choose the surface if your solid has holes through it. Leave it at genus 0 for anything convex, which covers almost every case.
- Switch to check mode when you already have all three counts and want to know whether they are consistent.
- Read the detail panel for the individual checks — Euler's relation, the face-degree bound, the vertex-degree bound, and the resulting average face and vertex degrees.
The Formula: How It Is Calculated
Euler's relation rearranges three ways, each a single subtraction: V = 2 − F + E, E = V + F − 2, and F = 2 − V + E. For the general surface, replace the 2 with the Euler characteristic χ = 2 − 2g, and every rearrangement follows the same pattern. MathWorld's article on the polyhedral formula gives the statement and its genus generalisation.
The intuition behind the proof is worth having. Remove one face of the polyhedron and flatten the remaining surface onto the plane; you now have a planar graph, and the removed face has become the unbounded outer region. Repeatedly triangulate faces and remove boundary edges, and each operation either adds one edge and one face, or removes one edge and one face, or removes one edge and one vertex — every one of which leaves V − E + F unchanged. Reduce all the way down to a single triangle, count 3 − 3 + 1 = 1, and add back the face you removed to get 2.
The Checks Euler's Formula Cannot Do
Satisfying V − E + F = 2 does not make a polyhedron possible. Three further conditions must also hold for a convex solid, and this tool tests all of them.
Every face is bounded by at least three edges, and every edge borders exactly two faces. Counting edge-face incidences two ways gives 2E ≥ 3F. Every vertex has at least three edges meeting at it, and every edge has exactly two endpoints, so counting edge-vertex incidences gives 2E ≥ 3V. Combining each of those with Euler's relation produces the classical bounds E ≤ 3V − 6 and E ≤ 3F − 6.
Those bounds explain why certain plausible-looking counts are impossible. A solid with 4 faces cannot have more than 6 edges, so the tetrahedron is the only four-faced polyhedron. And there is no polyhedron with exactly five faces all of which are triangles: five triangular faces would need 2E = 15 edge-face incidences, which is odd, and each edge contributes exactly two — so the count fails on parity alone, before any geometry is considered.
The Five Platonic Solids, and Why There Are Only Five
Euler's formula is what proves that exactly five regular convex polyhedra exist. Suppose every face is a regular p-gon and exactly q of them meet at every vertex. Counting incidences gives pF = 2E and qV = 2E, so F = 2E/p and V = 2E/q. Substituting into V − E + F = 2 and rearranging gives 1/p + 1/q = 1/2 + 1/E, which requires 1/p + 1/q > 1/2.
Since p and q are each at least 3, that inequality has only five integer solutions: (3,3), (3,4), (3,5), (4,3) and (5,3). Those are the tetrahedron, octahedron, icosahedron, cube and dodecahedron respectively, and there are no others — not because nobody has found a sixth, but because the arithmetic forbids one. It is one of the shortest complete classification proofs in mathematics, and it is entirely a consequence of the relation this page computes.
The counts for the five are: tetrahedron 4 vertices, 6 edges, 4 faces; cube 8, 12, 6; octahedron 6, 12, 8; dodecahedron 20, 30, 12; icosahedron 12, 30, 20. The cube and octahedron have their vertex and face counts swapped, as do the dodecahedron and icosahedron, because each pair is dual — replace every face with a vertex and every vertex with a face and you get the other solid. Duality leaves the edge count unchanged, which is why Euler's relation is preserved by it.
Where the Formula Breaks
Euler's relation in its familiar form holds for polyhedra topologically equivalent to a sphere. It fails for solids with holes, and it fails for some non-convex polyhedra even without holes. A cube with a square tunnel drilled straight through it has genus 1, so V − E + F = 0 rather than 2, which is exactly what the surface selector on this page accounts for.
It also fails for self-intersecting star polyhedra. The great dodecahedron and the small stellated dodecahedron both have 12 vertices, 30 edges and 12 faces, giving V − E + F = −6, because their faces pass through one another and the surface is not a simple sphere. Those solids are perfectly well-defined objects; they are just not what the formula was stated for.
A subtler failure comes from miscounting rather than topology. If two coplanar faces are recorded as one face, or a vertex where exactly two edges meet is counted as a vertex at all, the numbers stop describing a valid polyhedral subdivision and the formula returns something other than 2 for a perfectly ordinary solid. When a real cube gives an answer that is not 2, the counting is nearly always the culprit rather than the geometry.
How This Connects to the Volume and Area Tools
This page counts combinatorial features and says nothing about size. Euler's relation is topological: a cube and a wildly distorted six-faced blob have identical counts, and the formula cannot tell them apart. For the measurements, our cube calculator, rectangular prism calculator, tetrahedron volume calculator and pyramid volume calculator handle specific solids, and the surface area calculator covers the general case.
In two dimensions, the corresponding counting tool is our polygon calculator, which handles the interior-angle and diagonal counts for a flat n-gon. A polygon is the face of a polyhedron, and the face-degree condition tested here is what constrains which polygons can be assembled into a closed solid at all.
Arb Digital builds fast, accessible educational tools and the content that surrounds them. If you need working interactives rather than static formula pages, we can build them.
Content Marketing Services Talk to Arb DigitalCommon Mistakes to Avoid
- Counting each edge twice — an edge borders two faces but is still one edge, and double-counting is the single commonest cause of a wrong answer.
- Merging coplanar faces — if two flat faces meet along an edge and are recorded as one, the subdivision stops being valid and the formula no longer returns 2.
- Applying V − E + F = 2 to a solid with a hole — a tunnel through the solid makes the surface genus 1, and the right-hand side becomes 0.
- Treating Euler's relation as sufficient — passing it proves nothing on its own; the degree bounds 2E ≥ 3V and 2E ≥ 3F must hold as well.
- Expecting it to hold for star polyhedra — self-intersecting solids such as the great dodecahedron give −6, and that is correct rather than an error.
Related Free Tools From Arb Digital
Move from counting to measuring with the cube calculator, the rectangular prism calculator, the tetrahedron volume calculator, the pyramid volume calculator and the surface area calculator, or stay with counting in two dimensions using the polygon calculator. Everything else is listed in the free online tools hub.
Frequently Asked Questions
For any convex polyhedron, the number of vertices minus the number of edges plus the number of faces equals two: V − E + F = 2. A cube gives 8 − 12 + 6 = 2, and a tetrahedron gives 4 − 6 + 4 = 2. The relation holds regardless of how irregular the solid is.
Rearrange the formula to F = 2 − V + E. A solid with 8 vertices and 12 edges has 2 − 8 + 12 = 6 faces, which is the cube. The same rearrangement works for any convex polyhedron.
No. It holds for polyhedra whose surface is topologically a sphere. Solids with holes through them and self-intersecting star polyhedra both give a different value, because the Euler characteristic of their surface is not two.
It is the value of V − E + F for a given surface, written χ. For a sphere-like surface χ = 2; for a surface of genus g, meaning one with g holes, χ = 2 − 2g. A torus has one hole and therefore χ = 0.
Not necessarily. Euler's relation is a necessary condition, not a sufficient one. Two further conditions must also hold: 2E must be at least 3F, because every face has at least three edges, and 2E must be at least 3V, because at least three edges meet at every vertex.
Because substituting the regularity conditions into Euler's formula gives 1/p + 1/q greater than 1/2, where p is the number of sides per face and q the number of faces at each vertex. With both at least three, only five integer pairs satisfy it, and each corresponds to one solid.
Zero. One hole makes the surface genus 1, so χ = 2 − 2×1 = 0, and any polyhedral subdivision of that surface satisfies V − E + F = 0 rather than 2. Set the surface selector to genus 1 to compute on that basis.
This page performs exact integer arithmetic on the counts you supply and reports the standard necessary conditions for a convex polyhedron. Passing every check does not prove that a solid with those counts can be constructed; it establishes only that no elementary counting argument rules it out.
