On the number of sums and products

 Access to full text

 Full (PDF)

1. [1] J. Beck, On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős, Combinatorica 3 (1983), 281-297. Zbl0533.52004
2. [2] K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir and E. Welzl, Combinatorial complexity bounds for arrangements of curves and surfaces, Discrete Comput. Geom. 5 (1990), 99-106. Zbl0704.51003
3. [3] P. Erdős, On some of my favorite theorems, pages 97-132 of [6]. Zbl0853.11001
4. [4] P. Erdős, L. Alpár and G. Halász (eds.), Studies in Pure Mathematics, To the Memory of Paul Turán, Akadémiai Kiadó-Birkhäuser, Budapest-Basel, 1983. 
5. [5] P. Erdős and E. Szemerédi, On sums and products of integers, pages 213-218 of [4]. Zbl0526.10011
6. [6] D. Miklós, V. T. Sós and T. Szőnyi (eds.), Combinatorics, Paul Erdős is Eighty, János Bolyai Math. Soc., Budapest, 1996. Zbl0911.05001
7. [7] M. B. Nathanson, personal communication. 
8. [8] L. A. Székely, Crossing numbers and hard Erdős problems in Discrete Geometry, Combin. Probab. Comput., 1997, to appear. Zbl0882.52007
9. [9] E. Szemerédi and W. T. Trotter, Jr., Extremal problems in discrete geometry, Combinatorica 3 (1983), 381-392. Zbl0541.05012

1. József Solymosi, On sum-sets and product-sets of complex numbers