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
The Spherical Hadwiger Theorem
Suijie Wang, Shengguo Wu
Linear isoperimetric filling inequalities in Hadamard spaces at and above the asymptotic rank
Jonas W. Peteranderl
Isometry invariant valuations on spherical polytopes
Jonas Knoerr
The Kernel Deficit Dominates Twice the Hull Deficit: A Sharp Strengthening of Nakano's Inequality
Dakota Charles Baker
In Search of Melchior's Ordinary Points
Jonathan Lenchner, Rik Sengupta
Volume and Projection Inequalities II: Determinants and Lp-Sums
Matthieu Fradelizi, Auttawich Manui, Cheikh Saliou Ndiaye et al.