An upper bound for the diameter of a pol
✍
David Barnette
📂
Article
📅
1974
🏛
Elsevier Science
🌐
English
⚖ 515 KB
The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d