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

Simple item page
dc.creatorKalai, Gil
dc.creatorKleitman, Daniel J.
dc.date1992-04-01
dc.date.accessioned2026-07-07T09:14:46Z
dc.date.available2026-07-07T09:14:46Z
dc.descriptionThe diameter of the graph of a $d$-dimensional polyhedron with $n$ facets is at most $n^{\log d+2}$
dc.description2 pages
dc.identifierhttps://arxiv.org/abs/math/9204233
dc.identifierhttp://arxiv.org/abs/math/9204233
dc.identifierBull. Amer. Math. Soc. (N.S.) 26 (1992) 315-316
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152794
dc.subjectMetric Geometry
dc.subjectCombinatorics
dc.titleA quasi-polynomial bound for the diameter of graphs of polyhedra
dc.typetext

Files

Collections

arXiv