Hirsch conjecture

From Wikipedia, the free encyclopedia

You have new messages (last change).

In mathematical programming and geometry, Hirsch's conjecture states that the edge-vertex graph of an n-facet polytope in d-dimensional Euclidean space has diameter no more than n − d.

 This geometry-related article is a stub. You can help Wikipedia by expanding it.
This polyhedron-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../h/i/r/Hirsch_conjecture.html"