On a conjecture of Graham
✍ Scribed by Zaharescu Alexandru
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 346 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
## Abstract Chung defined a pebbling move on a graph __G__ to be the removal of two pebbles from one vertex and the addition of one pebble to an adjacent vertex. The pebbling number of a connected graph is the smallest number __f__(__G__) such that any distribution of __f__(__G__) pebbles on __G__