Name
Abstract | ||
|---|---|---|
We give simple randomized algorithms leading to new upper bounds for combinatorial problems of Choi and Erd?s: For an arbitrary additive group G let P n (G) denote the set of all subsets S of G with n elements having the property that 0 is not in S +S. Call a subset A of G admissible with respect to a set S from P n (G) if the sum of each pair of distinct elements of A lies outside S. Suppose first that S is a subset of the positive integers in the interval [2n; 4n). Denote by f(S) the number... |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/978-3-540-48413-4_15 | RANDOM-APPROX |
Keywords | Field | DocType |
probabilistic construction,sum-free sets,large sidon sets | Discrete mathematics,Topology,Probabilistic logic,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-66329-0 | 0 | 0.34 |
References | Authors | |
2 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Baltz | 1 | 30 | 6.68 |
| Tomasz Schoen | 2 | 36 | 12.04 |
| Anand Srivastav | 3 | 248 | 36.81 |