Alon, N., Balogh, J., Morris, R. and Samotij, W. (2014) Counting sum-free sets in Abelian groups. Israel J. Math. 199 309–344.
Bose, R. C. and Chowla, S. (1962/1963) Theorems in the additive theory of numbers. Comment. Math. Helv. 37 141–147.
Cameron, P. J. and Erdős, P. (1990) On the number of sets of integers with various properties. In Number Theory (Banff 1988), de Gruyter, pp. 61–79.
Chen, S. (1994) On the size of finite Sidon sequences. Proc. Amer. Math. Soc. 121 353–356.
Chowla, S. (1944) Solution of a problem of Erdős and Turán in additive-number theory. Proc. Nat. Acad. Sci. India. Sect. A 14 1–2.
Cilleruelo, J. (2001) New upper bounds for finite Bh sequences. Adv. Math. 159 1–17.
Conlon, D. and Gowers, W. T. (2010) Combinatorial theorems in sparse random sets. Submitted.
D'yachkov, A. G. and Rykov, V. V. (1984) Bs-sequences. Mat. Zametki 36 593–601.
Erdős, P. (1944) On a problem of Sidon in additive number theory and on some related problems: Addendum. J. London Math. Soc. 19 208.
Erdős, P. and Turán, P. (1941) On a problem of Sidon in additive number theory, and on some related problems. J. London Math. Soc. 16 212–215.
Green, B. (2001) The number of squares and Bh[g] sets. Acta Arith. 100 365–390.
Halberstam, H. and Roth, K. F. (1983) Sequences, second edition, Springer.
Hardy, G. H., Littlewood, J. E. and Polya, G. (1934) Inequalities, Cambridge University Press.
Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley-Interscience.
Jia, X. D. (1993) On finite Sidon sequences. J. Number Theory 44 84–92.
Kleitman, D. J. and Wilson, D. B. (1996) On the number of graphs which lack small cycles. Unpublished Manuscript.
Kleitman, D. J. and Winston, K. J. (1982) On the number of graphs without 4-cycles. Discrete Math. 41 167–172.
Kohayakawa, Y., Lee, S. J., Rödl, V. and Samotij, W. (2015) The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers. Random Struct. Alg. 46 1–25.
Kohayakawa, Y., Lee, S. and Rödl, V. (2011) The maximum size of a Sidon set contained in a sparse random set of integers. In Proc. Twenty-Second Annual ACM–SIAM Symposium on Discrete Algorithms (Philadelphia, PA), SIAM, pp. 159–171.
Kohayakawa, Y., Łuczak, T. and Rödl, V. (1996) Arithmetic progressions of length three in subsets of a random set. Acta Arith. 75 133–163.
Kolountzakis, M. N. (1996) The density of Bh[g] sequences and the minimum of dense cosine sums. J. Number Theory 56 4–11.
Krückeberg, F. (1961) B 2-Folgen und verwandte Zahlenfolgen. J. Reine Angew. Math. 206 53–60.
Lee, S. J. On Sidon sets in a random set of vectors. J. Korean Math. Soc., to appear.
Lindström, B. (1969) A remark on B 4-sequences. J. Combin. Theory 7 276–277.
O'Bryant, K. (2004) A complete annotated bibliography of work related to Sidon sequences. Electron. J. Combin. Dynamic Surveys 11 (electronic).
Roth, K. F. (1953) On certain sets of integers. J. London Math. Soc. 28 104–109.
Saxton, D. and Thomason, A. (2015) Hypergraph containers, Invent. Math., 201 925–992
Schacht, M. Extremal results for random discrete structures. Submitted.
Shparlinskii, I. E. (1986) On Bs-sequences. In Combinatorial Analysis, no. 7 (Russian), Moscow State University, pp. 42–45.
Singer, J. (1938) A theorem in finite projective geometry and some applications to number theory. Trans. Amer. Math. Soc. 43 377–385.
Szemerédi, E. (1975) On sets of integers containing no k elements in arithmetic progression. Acta Arith. 27 199–245.