Definition Steinitz's theorem is a fundamental result in the fields of polyhedral combinatorics and graph theory, which characterizes the graphs formed by the vertices and edges of three-dimensional convex polyhedra.
Overview Steinitz's theorem establishes a precise correspondence between convex polyhedra in three-dimensional Euclidean space and a certain class of graphs. It states that a graph G is the skeleton (i.e., the graph formed by vertices and edges) of a convex polyhedron if and only if G is planar and 3-vertex-connected. This result provides a complete combinatorial description of the graphs of 3-dimensional convex polytopes, linking discrete geometry with graph-theoretical properties.
Etymology/Origin The theorem is named after Ernst Steinitz, a German mathematician who first proved the result in the early 20th century. His work was published in the 1922 book "Polyeder und Raumeinteilungen" in the Encyklopädie der mathematischen Wissenschaften. Steinitz's contribution laid the foundation for the combinatorial study of polyhedra.
Characteristics
- The theorem applies specifically to 3-dimensional convex polyhedra.
- A graph is polyhedral (i.e., represents the edges and vertices of a convex polyhedron) if and only if it is planar and 3-vertex-connected.
- Planarity means the graph can be drawn in the plane without edge crossings.
- 3-vertex-connected means that at least three vertices must be removed to disconnect the graph.
- Every such graph corresponds to a convex polyhedron via a realization in ℝ³, as guaranteed by the theorem.
Related Topics
- Convex polytopes
- Planar graphs
- Graph connectivity
- Polyhedral combinatorics
- Euler's polyhedron formula
- Tutte embedding
- Koebe–Andreev–Thurston circle packing theorem
The theorem is a cornerstone in discrete geometry and has inspired generalizations and analogous results in higher dimensions, though analogous characterizations for 4-dimensional polytopes remain incomplete.