Balinski's theorem
In polyhedral combinatorics, a branch of mathematics, Balinski's theorem is a statement about the graph-theoretic structure of three-dimensional polyhedra and higher-dimensional polytopes. It states that, if one forms an undirected graph from the vertices and edges of a convex d-dimensional polyhedron or polytope (its skeleton), then the resulting graph is at least d-vertex-connected: the removal of any d − 1 vertices leaves a connected subgraph. For instance, for a three-dimensional polyhedron, even if two of its vertices (together with their incident edges) are removed, for any pair of vertices there will still exist a path of vertices and edges connecting the pair.
primaryTopic
Balinski's theorem
In polyhedral combinatorics, a branch of mathematics, Balinski's theorem is a statement about the graph-theoretic structure of three-dimensional polyhedra and higher-dimensional polytopes. It states that, if one forms an undirected graph from the vertices and edges of a convex d-dimensional polyhedron or polytope (its skeleton), then the resulting graph is at least d-vertex-connected: the removal of any d − 1 vertices leaves a connected subgraph. For instance, for a three-dimensional polyhedron, even if two of its vertices (together with their incident edges) are removed, for any pair of vertices there will still exist a path of vertices and edges connecting the pair.
has abstract
En combinatoria poliédrica, un ...... tres grafos planos conectados.
@es
In polyhedral combinatorics, a ...... three-connected planar graphs.
@en
数学の一分野である多面体組み合わせ論におけるバリンスキーの定 ...... フであるというシュタイニッツの定理として結果が得られていた。
@ja
thumbnail
Wikipage page ID
24,732,291
Wikipage revision ID
680,300,334
subject
hypernym
comment
En combinatoria poliédrica, un ...... y aristas que conectan el par.
@es
In polyhedral combinatorics, a ...... and edges connecting the pair.
@en
数学の一分野である多面体組み合わせ論におけるバリンスキーの定 ...... フであるというシュタイニッツの定理として結果が得られていた。
@ja
label
Balinski's theorem
@en
Teorema de Balinski
@es
バリンスキーの定理
@ja
