Name
Abstract | ||
|---|---|---|
A set S of positive integers has distinct subset sums if there are 2jSj dis- tinct elements of the set P x2X x : X S. Let f(n) = minfmaxS : jSj = n and S has distinct subset sumsg. Erd}os conjectured f(n) c2n for some constant c. We give a construction that yields f(n) < 0:22002 2n for n su- ciently large. This now stands as the best known upper bound on f(n). |
Year | Venue | Keywords |
|---|---|---|
1998 | Electr. J. Comb. | upper bound |
Field | DocType | Volume |
Integer,Discrete mathematics,Combinatorics,Upper and lower bounds,Mathematics | Journal | 5 |
Citations | PageRank | References |
2 | 0.46 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Bohman | 1 | 250 | 33.01 |