1. Alon, N., Erdős, P.: An application of graph theory to additive number theory. European J. Combin. 6, 201–203 (1985)
2. Balog, A., Wooley, T.D.: A low-energy decomposition theorem. Q. J. Math. 68, 207–226 (2017)
3. P. Erdős, Extremal problems in number theory, combinatorics and geometry, in: Proceedings of the International Congress of Mathematicians (Warsaw, 1983), Vols. 1,2, PWN (Warsaw, 1984), pp. 51–70
4. W. T. Gowers, What are dense Sidon subsets of $$\{1,2 , \ldots ,n\}$$ like?, blog post https://gowers.wordpress.com/2012/07/13/what-are-dense-sidon-subsets-of-12-n-like/
5. Y. Kohayakawa, S. Lee and V. Rödl, The maximum size of a Sidon set contained in a sparse random set of integers, in: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM (Philadelphia, PA, 2011), pp. 159–171