𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Upper-Bound theorem for families of convex sets

✍ Scribed by Jürgen Eckhoff

Publisher
Springer
Year
1985
Tongue
English
Weight
470 KB
Volume
19
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for sets
An upper bound for sets
✍ Gang Yu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 134 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 upper bound theorem for polytopes: a
The upper bound theorem for polytopes: an easy proof of its asymptotic version
✍ Raimund Seidel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 128 KB

Since at least half of the d edges incident to a vertex u of a simple d-polytope P either all point "up" or all point "down," v must be the unique "bottom" or "top" vertex of a face of P of dimension at least d/2. Thus the number of P's vertices is at most twice the number of such high-dimensional f

An intersection theorem for systems of s
An intersection theorem for systems of sets
✍ A. V. Kostochka 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 2 views

Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists