A counterexample to a conjecture of Erdős, Graham and Spencer
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

It is conjectured by Erdős, Graham and Spencer that if $1 \leq a_1 \leq a_2 \leq \cdots \leq a_s$ with $\sum_{i=1}^s 1/a_i < n - 1/30$, then this sum can be decomposed into $n$ parts so that all partial sums are $\leq 1$. In this note we propose a counterexample which gives a negative answer to this conjecture.
DOI : 10.37236/918
Classification : 11B75
Mots-clés : Erdős-Graham-Spencer conjecture, Erdős problem, partition
@article{10_37236_918,
     author = {Song Guo},
     title = {A counterexample to a conjecture of {Erd\H{o}s,} {Graham} and {Spencer}},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/918},
     zbl = {1206.11033},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/918/}
}
TY  - JOUR
AU  - Song Guo
TI  - A counterexample to a conjecture of Erdős, Graham and Spencer
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/918/
DO  - 10.37236/918
ID  - 10_37236_918
ER  - 
%0 Journal Article
%A Song Guo
%T A counterexample to a conjecture of Erdős, Graham and Spencer
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/918/
%R 10.37236/918
%F 10_37236_918
Song Guo. A counterexample to a conjecture of Erdős, Graham and Spencer. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/918

Cité par Sources :