Steinitz theorem

from Wikipedia, the free encyclopedia

The set of Steinitz , English Steinitz's theorem , is a mathematical theorem which both the area of the topological graph theory , as well as that of the geometric graph theory is attributable. The sentence stems from a publication of the mathematician Ernst Steinitz (1871-1928) from 1916 and counts along with the Euler Polyedersatz , the Kuratowski's theorem and the theorem of Wagner to the classical results of graph theory on planar graphs .

Formulation of the sentence

The sentence can be stated as follows:

A finite, simple graph has a straight line representation as - dimensional polyhedron graph if and only if it is flattenable and at the same time -fold connected .

Meaning of the sentence

Steinitz's theorem is one of the fundamental theorems in the doctrine of the polyhedra and apparently Ernst Steinitz himself assessed it that way. As Branko Grünbaum this in his 1975 feature article Polytopal Graphs points out, called Steinitz his sentence, therefore, even as the fundamental theorem of convex types [of polyhedra] ( English Fundamental Theorem of Convex type [of Polyhedra] ) and presented to as many as three elaborate evidence. These are presented in the classic monograph lectures on the theory of polyhedra by Steinitz and Rademacher . How Green Tree continues to write, this representation does not the modern terms served graph theory - such as the relationship or the planarity - but its own terms, which Steinitz 'argument (from today's perspective) quite cumbersome ( English rather cumbersome ) was.

Related sentence

A related theorem, which concerns the polytopes of all higher dimensions and was found by the mathematician Michel Louis Balinski , is the following:

If a finite, simple graph has a straight line representation as -dimensional polytopgraph in , then it is necessarily -fold connected.

literature

References and footnotes

  1. a b Branko Grünbaum: Polytopal Graphs . In: DR Fulkerson (Ed.): Studies in Graph Theory . Part II. 1975, p. 203
  2. ^ Lowell W. Knieke, Robin J. Wilson: Topics in Topological Graph Theory , 2009, p. 11
  3. ^ Frank Harary: Grape theory. 1974, p. 115
  4. Grünbaum, op.cit., P. 204
  5. ML Balinski: On the graph structure of convex polyhedra in n-space. in: Pacific J. Math. 11, pp. 431-434