A quasi-polynomial bound for the diameter of graphs of polyhedra

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/152794The diameter of the graph of a $d$-dimensional polyhedron with $n$ facets is at most $n^{\log d+2}$2 pagesMetric GeometryCombinatoricsA quasi-polynomial bound for the diameter of graphs of polyhedratext