Wikimore

Summary

DescriptionBalinski.svg	English: Visual proof of Balinski's theorem: if fewer than d vertices (yellow) are removed from the graph of a d-dimensional polytope, then it is possible to find a nontrivial function whose zero set (the blue plane) includes another vertex (green). Then the simplex method can be used to find paths from the selected vertex to the two extreme points of the linear function, and from every other vertex to at least one extreme point, connecting all of the remaining vertices. Therefore, one must remove at least d vertices in order to disconnect the remaining graph.
Date	9 September 2015
Source	Own work
Author	David Eppstein

I, the copyright holder of this work, hereby publish it under the following license:

You are free:

Under the following conditions:

attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.