𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a problem of Chvátal and Erdös on hypergraphs containing no generalized simplex

✍ Scribed by Peter Frankl


Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
494 KB
Volume
30
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On a Problem of Erdős and Sárközy
✍ Tomasz Schoen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 89 KB

Let A=[a 1 , a 2 , ...] N and put A(n)= a i n 1. We say that A is a P-set if no element a i divides the sum of two larger elements. It is proved that for every P-set A with pairwise co-prime elements the inequality A(n)<2n 2Â3 holds for infinitely many n # N. ## 2001 Academic Press where A(n)= a i