Theorem

Balinski's Theorem

Combinatorics and Graph Theory

Balinski's Theorem describes the graph-theoretic structure of convex polyhedra and higher-dimensional convex polytopes, stating that the graph formed from the vertices and edges of a d-dimensional convex polyhedron or polytope is at least d-vertex-connected, so removing any d minus one vertices leaves the remaining graph connected. Named after Michel Balinski, who published its proof in 1961, the three-dimensional case of the result traces back earlier in the century to Steinitz's theorem characterizing the graphs of three-dimensional polyhedra as the three-connected planar graphs.

Facts
Statement
The skeleton graph formed from the vertices and edges of any d dimensional convex polyhedron or polytope is at least d vertex connected, so removing any fewer than d vertices leaves the remaining graph connected. 1
Proof Year
1961 1
Classification
Statement Form
Inequality 1
Connections

Has Statement Form

Inequality, Concepts

In Branch

Source Balinski's theorem (Wikipedia)

Principal Result Of

Source Michel Balinski (Wikipedia)

Proved By

Source Balinski's theorem (Wikipedia)
Sources
1. Balinski's theorem (Wikipedia)
Wikimedia Foundation
  • Lead section
    Balinski's theorem is named after mathematician Michel Balinski, who published its proof in 1961, although the three-dimensional case dates back to the earlier part of the 20th century and the discovery of Steinitz's theorem that the graphs of three-dimensional polyhedra are exactly the three-connected planar graphs.
  • Proved By: Michel Balinski, Lead sentence
    Balinski's theorem is named after mathematician Michel Balinski, who published its proof in 1961, although the three-dimensional case dates back to the earlier part of the 20th century and the discovery of Steinitz's theorem that the graphs of three-dimensional polyhedra are exactly the three-connected planar graphs.
  • In Branch: Combinatorics, Lead sentence
    In polyhedral combinatorics, a branch of mathematics, Balinski's theorem is a statement about the graph-theoretic structure of thr
View the Source
Michel Balinski (Wikipedia)
Principal Result Of: Michel Balinski, Body, work
Quote, Principal Result Of: Michel Balinski, Body, work
it is known as Balinski's theorem
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.

Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme