An upper bound for the diameter of a polytope

DOI10.1016/0012-365X(74)90016-8zbMath0294.52007OpenAlexW2026730018MaRDI QIDQ1212692

D. W. Barnette

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90016-8

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx)

Related Items (17)

Improving bounds on the diameter of a polyhedron in high dimensions ⋮ Obstructions to weak decomposability for simplicial polytopes ⋮ Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable ⋮ Distance between vertices of lattice polytopes ⋮ Hirsch polytopes with exponentially long combinatorial segments ⋮ Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ A counterexample to the Hirsch conjecture ⋮ A Friendly Smoothed Analysis of the Simplex Method ⋮ Polytopes and arrangements: diameter and curvature ⋮ On sub-determinants and the diameter of polyhedra ⋮ Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count ⋮ On the diameter of dual graphs of Stanley-Reisner rings and Hirsch type bounds on abstractions of polytopes ⋮ On the shadow simplex method for curved polyhedra ⋮ Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes ⋮ A spectral approach to polytope diameter ⋮ The width of five-dimensional prismatoids ⋮ The Hirsch Conjecture Holds for Normal Flag Complexes

Cites Work

• The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
• Paths on Polytopes
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound for the diameter of a polytope