A quasi-polynomial bound for the diameter of graphs of polyhedra
Abstract
The diameter of the graph of a d-dimensional polyhedron with n facets is at most n d+2
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.