Diameter of Polyhedra: Limits of Abstraction 3: Larman's Bound 2^(d−1)·n Holds in the Base AbstractionResearch Paper
The diameter of a polyhedron is the largest number of edges needed to travel between two vertices of its graph, its 1-skeleton. Whether this number is bounded by a polynomial in the dimension and the number of facets is a long-standing open question in polyhedral combinatorics; edge walks are the moves of vertex-following methods such as the simplex…