A Curved-Path Refinement of the Kalai--Kleitman Diameter Bound

Tianhao Liu, Dongdong Ge, Yinyu Ye

Let ${\Delta }_u(d,n)$ be the maximum graph diameter of a pointed $d$-dimensional polyhedron with $n$ facets. Using a curved-path encoding of the iterated Kalai--Kleitman recurrence, we pr…