Linked from
The 37 pages that link to Euler characteristic, each with the reason it gives.
HomeomorphismRelated: For suitable spaces, this invariant helps distinguish topological types.
FullereneRelated: For a closed trivalent cage, it constrains the ring pattern to twelve pentagons.
Tree (graph theory)Related: For a tree, the vertex count minus the edge count equals one.
Vertex (geometry)Related: For convex polyhedra, vertex counts enter the relation V − E + F = 2.
Gauss–Bonnet theoremRelated: The theorem’s curvature integral is fixed by this invariant.
Homology groupRelated: It can be calculated as an alternating sum of the ranks of homology groups.
TorusRelated: The torus has Euler characteristic zero, consistent with its genus.
Morse theoryRelated: The alternating sum of Morse critical-point counts equals this invariant.
TetrahedronRelated: Its polyhedral formula gives 4 − 6 + 4 = 2 for a tetrahedron.
Möbius stripRelated: The strip's Euler characteristic is zero, linking its boundary and topology.
Poincaré–Hopf theoremRelated: The sum of zero indices is constrained to equal this global invariant.
Handshaking lemmaRelated: Degree sums help relate vertices and edges in planar graph formulas.
IcosahedronRelated: Its formula checks the icosahedron's counts of vertices, edges, and faces.
Regular dodecahedronRelated: Its counts satisfy 20 − 30 + 12 = 2.
Cell (topology)Related: Counting cells by dimension gives a direct way to calculate this invariant.
Honeycomb theoremRelated: Planar topology constrains how many sides cells can have on average.