Erdős Problem #772 — Large Sidon subsets of bounded-representation sets
For fixed , let be the largest integer such that every -element set of integers in which each integer has at most representations as a sum of two elements contains a Sidon subset of size . Does ? Is for some absolute ?
References
Primary source
Additional references
P. Erdős, Some applications of Ramsey's theorem to additive number theory, European Journal of Combinatorics 1 (1980), 43–46.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.