Skip to main content
Edges & Surfaces

The graph theory of Leonhard Euler

Edges & Surfaces — Part 3 of 3

The Euler Characteristic

In Parts 1 and 2, counting edges told us whether a walk was possible and how to make it optimal. Now Euler asks a deeper question about the same ingredients — vertices, edges, faces — but applied to surfaces rather than routes. Pick any polyhedron. Compute V − E + F. You always get the same number, no matter how you carve up the surface. That number is not a property of the shape: it is a property of the topology — the number of holes. This single formula, discovered by Euler in 1758, is the foundation of modern topology.

Shape
Step 1 / 5
— Vertices (V)
−
— Edges (E)
+
— Faces (F)
=
? χ (chi)
Meet the cube. 8 vertices, 12 edges, 6 faces — the most familiar polyhedron. Drag to rotate, then press Next.

Try it yourself

  1. Grab any object: a box, a die, a pyramid toy.
  2. Count every corner (V), every edge (E), every flat face (F).
  3. Compute V − E + F. You will always get 2 — for any shape without holes.
  4. Now find a mug with a handle. Count again. You get 0. One hole changes everything.

The same Euler, the same arithmetic

In Parts 1 and 2, edges were things to traverse. Here they are things to count as part of V − E + F. But the underlying move is identical: Euler abstracts a physical object into a combinatorial structure, counts its pieces, and finds an invariant that reveals hidden structure.

The Euler characteristic χ = V − E + F is a topological invariant: it does not change under any deformation — only under cutting or hole-punching. This is the same local-to-global principle that governed degree in Parts 1 and 2: a local count (at each vertex, face, or edge) determines a global property (the shape of the whole surface).

Completing the picture — from bridges to the shape of space

The three parts of this series trace a single idea across 22 years of Euler's work. In 1736, he showed that the degrees of vertices in a graph determine whether an edge-traversal is possible. In 1758, he showed that counting vertices, edges, and faces of a polyhedron reveals its topological type. Both results say: discrete counting determines continuous structure.

Fullerene chemistry — Euler's formula predicts that any closed carbon cage must have exactly 12 pentagonal faces, regardless of size. C₆₀, C₇₀, C₈₄ all obey this without exception — a direct consequence of χ = 2.

Geodesic domes — any dome derived from a sphere always needs exactly 12 pentagons to close. Buckminster Fuller's designs all share this feature because χ = 2 forces it.

Mesh validation — 3D printing software and game engines compute χ to detect holes or inverted faces. A valid closed mesh must have χ = 2, just as a graph must have all-even degrees for an Eulerian circuit (Part 1).

String theory — the Euler characteristic classifies the Calabi-Yau manifolds used as compact extra dimensions. Different values of χ correspond to different possible particle spectra. The same number Euler found by counting corners of a cube constrains models of the universe.

The formula — and its place in the trilogy

For any connected polyhedron homeomorphic to a sphere: V − E + F = 2

For a surface of genus g — genus is the mathematical word for the number of holes: a sphere has genus 0, a donut has genus 1, a figure-8 surface has genus 2 — the general formula is: χ = 2 − 2g

The proof uses the same handshaking lemma from Part 2: the sum of all vertex degrees equals 2E (each edge contributes to exactly two vertices). This identity appears inside the proof that V − E + F is invariant under triangulation.

Euler proved the first result in 1758. Poincaré generalised it to manifolds of all dimensions in the early 1900s, creating algebraic topology. The Euler characteristic of a graph (vertices minus edges, no faces) is χ = V − E — the same formula with F = 0. The Königsberg graph has χ = 4 − 7 = −3. The Chinese Postman's augmented graph has a higher χ. The full formula V − E + F = 2 is what you get when you close a graph into a surface by filling in the faces.

The Euler Characteristic