Kohayakawa, Yoshiharu; Lee, Sangjune; Rödl, Vojtěch The maximum size of a Sidon set contained in a sparse random set of integers. (English) Zbl 1381.11011 Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 159-171 (2011). Cited in 4 Documents MSC: 11B34 Representation functions 11B13 Additive bases, including sumsets 05D05 Extremal set theory 43A46 Special sets (thin sets, Kronecker sets, Helson sets, Ditkin sets, Sidon sets, etc.) Keywords:Sidon set; sparse random set of integers Citations:Zbl 0063.00874; JFM 67.0984.03 PDFBibTeX XMLCite \textit{Y. Kohayakawa} et al., in: Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23--25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 159--171 (2011; Zbl 1381.11011) Full Text: Link