Erdős Problem #772 — Large Sidon subsets of bounded-representation sets

About 46 years old · traced to

For fixed k≥1k≥1, let Hk(n)H_k(n) be the largest integer such that every nn-element set of integers in which each integer has at most kk representations as a sum of two elements contains a Sidon subset of size Hk(n)H_k(n). Does Hk(n)/√n→∞H_k(n)/√n→∞? Is Hk(n)>n1/2+cH_k(n)>n^{1/2+c} for some absolute c>0c>0?

References

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.