Many polytopes meeting the conjectured Hirsch bound
From MaRDI portal
Publication:1269445
DOI10.1007/PL00009372zbMATH Open0926.52013MaRDI QIDQ1269445FDOQ1269445
Authors: Victor Klee, Fred B. Holt 
Publication date: 29 November 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
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)
Cited In (20)
- Computational determination of the largest lattice polytope diameter
- On the circuit diameter conjecture
- The width of five-dimensional prismatoids
- More bounds on the diameters of convex polytopes
- Blending simple polytopes at faces
- The diameters of network-flow polytopes satisfy the Hirsch conjecture
- Edge-graph diameter bounds for convex polytopes with few facets
- Diameter and Curvature: Intriguing Analogies
- More polytopes meeting the conjectured Hirsch bound
- Polytopes and arrangements: diameter and curvature
- A continuous \(d\)-step conjecture for polytopes
- The Hirsch conjecture is true for (0,1)-polytopes
- A counterexample to the Hirsch conjecture
- An update on the Hirsch conjecture
- Maximal triangulations of a regular prism
- Linear programming, the simplex algorithm and simple polytopes
- One-point suspensions and wreath products of polytopes and spheres
- The hierarchy of circuit diameters and transportation polytopes
- The diameter of the ridge-graph of a cyclic polytope
- On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes
This page was built for publication: Many polytopes meeting the conjectured Hirsch bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269445)
