Balinski's theorem
id:
balinski-s-theorem-283-4725606
title:
Balinski's theorem
text:
In polyhedral combinatorics, a branch of mathematics, Balinski's theorem is a statement about the graph-theoretic structure of three-dimensional convex polyhedra and higher-dimensional convex polytopes. It states that, if one forms an undirected graph from the vertices and edges of a convex d-dimensional convex polyhedron or polytope, 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 polyh
brand slug:
wiki
category slug:
encyclopedia
description:
Graphs of d-dimensional polytopes are d-connected
original url:
https://en.wikipedia.org/wiki/Balinski%27s_theorem
date created:
date modified:
2023-04-18T12:30:19Z
main entity:
{"identifier":"Q32182","url":"https://www.wikidata.org/entity/Q32182"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/6/6c/Balinski.svg","width":800,"height":1111}
fields total:
13
integrity:
15