𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some remarks on a problem of Erdős and Graham

✍ Scribed by N. Hegyvári

Publisher
Akadmiai Kiad
Year
1989
Tongue
English
Weight
267 KB
Volume
53
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a conjecture of Erdős, Graham and Spe
On a conjecture of Erdős, Graham and Spencer
✍ Yong-Gao Chen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 102 KB

It is conjectured by Erdős, Graham and Spencer that if 1 a 1 a 2 • • • a s with s i=1 1/a i < n -1/30, then this sum can be decomposed into n parts so that all partial sums are 1. This is not true for s i=1 1/a i = n -1/30 as shown by In 1997, Sándor proved that Erdős-Graham-Spencer conjecture is t

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