✦ LIBER ✦

Upper bounds for configurations and polytopes inRd

✍ Scribed by Jacob E. Goodman; Richard Pollack

Publisher: Springer
Year: 1986
Tongue: English
Weight: 509 KB
Volume: 1
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02187696

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bounds for edge-antipodal and sube

Upper bounds for edge-antipodal and subequilateral polytopes

✍ Konrad J. Swanepoel 📂 Article 📅 2007 🏛 Springer Netherlands 🌐 English ⚖ 129 KB

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

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

On the upper-bound conjecture for convex

On the upper-bound conjecture for convex polytopes

✍ P McMullen 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 555 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

Lower bounds and upper bounds for chroma

Lower bounds and upper bounds for chromatic polynomials

✍ Klaus Dohmen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.