𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On An Extremal Hypergraph Problem Of Brown, Erdős And Sós

✍ Scribed by Noga Alon*; Asaf Shapira†

Publisher
Springer-Verlag
Year
2006
Tongue
English
Weight
286 KB
Volume
26
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On an anti-Ramsey problem of Burr, Erdős
On an anti-Ramsey problem of Burr, Erdős, Graham, and T. Sós
✍ Gábor N. Sárközy; Stanley Selkow 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract Given a graph __L__, in this article we investigate the anti‐Ramsey number χ~__S__~(n,e,L), defined to be the minimum number of colors needed to edge‐color some graph __G__(__n__,__e__) with __n__ vertices and __e__ edges so that in every copy of __L__ in __G__ all edges have different

On a Problem of Erdős
On a Problem of Erdős
✍ Csaba Sándor 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Theorem 1. For every n 2 there exist integers 1<a 1 <a 2 < } } } <a s such that s i=1 1Âa i <n and this sum cannot be split into n parts so that all partial sums are 1.

On a problem of P. Erdős
On a problem of P. Erdős
✍ Carla Antonia; Angela Dalena 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 225 KB
On a Problem of Erdős and Sárközy
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