A quasi-polynomial bound for the diameter of graphs of polyhedra
Gil Kalai, Daniel J. Kleitman
math.MGarXiv:math/9204233
Abstract
The diameter of the graph of a d-dimensional polyhedron with n facets is at most n d+2
Create a lesson
Related papers
Each simplex in R4 has a point with at least 14 emanating normals to its boundary
Ivan Nasonov, Gaiane Panina
Pointed Gromov-Hausdorff Distance between lp-Wedge Sums and Isometric Embeddings of l∞
Emin Abdullaev
Embedding large subsets of Wasserstein spaces into Banach spaces
Cyril Letrouit, Quentin Mérigot
A Smooth Covariogram and the Transition Between Projection Bodies
J. Haddad, C. H. Jiménez, M. Resende Guedes
Intermediate coverings, random images, and projections
Yunhao Zhao, Yingyu Zhao, Chen Zhou et al.
On the Graph Corresponding to Center of Distances of Metric Space
Oleksiy Dovgoshey, Olga Rovenska