✦ LIBER ✦

On the upper-bound conjecture for convex polytopes

✍ Scribed by P McMullen

Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 555 KB
Volume: 10
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90042-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Upper Bound Theorem for Rational Poly

An Upper Bound Theorem for Rational Polytopes

✍ Margaret M Bayer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 190 KB

The upper bound inequality h i (P)&h i&1 (P) ( n&d+i&2 i ) (0 i dÂ2) is proved for the toric h-vector of a rational convex d-dimensional polytope with n vertices. This gives nonlinear inequalities on flag vectors of rational polytopes. ## 1998 Academic Press A major result in polytope theory is th

Many Polytopes Meeting the Conjectured H

Many Polytopes Meeting the Conjectured Hirsch Bound

✍ F. B. Holt; V. Klee 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 250 KB

The lower and upper bound problems for c

The lower and upper bound problems for cubical polytopes

✍ William Jockusch 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 295 KB

Upper bounds for configurations and poly

Upper bounds for configurations and polytopes inRd

✍ Jacob E. Goodman; Richard Pollack 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 509 KB

Upper bounds on geometric permutations f

Upper bounds on geometric permutations for convex sets

✍ Rephael Wenger 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 408 KB

An upper bound for the diameter of a pol

An upper bound for the diameter of a polytope

✍ 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