Many polytopes meeting the conjectured Hirsch bound
From MaRDI portal
Publication:1269445
DOI10.1007/PL00009372zbMath0926.52013MaRDI QIDQ1269445
Publication date: 29 November 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Related Items
Blending simple polytopes at faces, More bounds on the diameters of convex polytopes, Diameter and Curvature: Intriguing Analogies, Linear programming, the simplex algorithm and simple polytopes, The diameter of the ridge-graph of a cyclic polytope, The hierarchy of circuit diameters and transportation polytopes, A counterexample to the Hirsch conjecture, Polytopes and arrangements: diameter and curvature, On the circuit diameter conjecture, On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes, One-point suspensions and wreath products of polytopes and spheres, The diameters of network-flow polytopes satisfy the Hirsch conjecture, A continuous \(d\)-step conjecture for polytopes, More polytopes meeting the conjectured Hirsch bound