✳flâneur — a map of the web's best reading

Steinitz's theorem

en.wikipedia.org · 7,301 words · saved by 1 readers

In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra: they are exactly the 3-vertex-connected planar graphs. That is, every convex polyhedron forms a 3-connected planar graph, and every 3-connected planar graph can be represented as the graph of a convex polyhedron. For this reason, the 3-connected planar graphs are also known as polyhedral graphs.This result provides a classification theorem for the three-dimensional convex polyhedra, something that is not known in higher dimensions. It provides a complete and purely combinatorial description of the graphs of these polyhedra, allowing other results on them, such as Eberhard's theorem on the realization of polyhedra with given types of faces, to be proven more easily, without reference to the geometry of these shapes. Additionally, it has been applied in graph drawing, as a way to construct three-dimensional visualizations of abstract graphs. Branko Grünbaum has called this theorem "the most important and deepest known result on 3-polytopes."The theorem appears in a 1922 publication of Ernst Steinitz, after whom it is named. It can be proven by mathematical induction (as Steinitz did), by finding the minimum-energy state of a two-dimensional spring system and lifting the result into three dimensions, or by using the circle packing theorem.

Steinitz's theorem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Graph-theoretic description of polyhedra This article is about the theorem on graphs of polyhedra. For other uses, see Steinitz's theorem (disambiguation) . In polyhedral combinatorics , a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices of three-dimensional convex polyhedra : they are exactly the 3-vertex-connected planar graphs . That is, every convex polyhedron forms a 3-connected planar graph, and every 3-connected planar graph can be

Explore this link on the map →

related reading