1. Solymosi, József and Frank De Zeeuw. 'On a question of Erdős and Ulam'. Discrete & Computational Geometry, Volume 43, Issue 2 (2010), Page

Transcription

1 PUBLIKÁCIÓK: 1. Solymosi, József and Frank De Zeeuw. 'On a question of Erdős and Ulam'. Discrete & Computational Geometry, Volume 43, Issue 2 (2010), Page Solymosi, József. 'Spectral bounds on incidences'. Additive Combinatorics. Ed. Javier Cilleruelo, Marc Noy and Oriol Serra. Advanced Courses in Mathematics CRM Barcelona. Basel: Birkhäuser Pach, János, József Solymosi and Gábor Tardos. 'Crossing numbers of imbalanced graphs'. JOURNAL OF GRAPH THEORY. Published Online: 11 Aug pages. DOI: /jgt Solymosi, József and Van Vu. 'Sum-product estimates for wellconditioned matrices'. Bulletin of the London Mathematical Society (5): Solymosi, József. 'Bounding multiplicative energy by the sumset'. Advances in Mathematics, Volume 222, Issue 2, 2009, Graham, Ron and József Solymosi. 'Some Ramsey results for the n- cube', Journal of Combinatorial Theory, Series A, Volume 117, Issue 2, 2010, , 7. Solymosi, József and Konrad Swanepoel. 'Elementary incidence theorems for complex numbers and quaternions'. SIAM JOURNAL ON DISCRETE MATHEMATICS (2008): Solymosi, József. 'Incidences and the Spectra of Graphs'. Building Bridges between Mathematics and Computer Science. Vol. 19. Ed. Martin Groetschel and Gyula Katona. Series: Bolyai Society Mathematical Studies. Springer, Solymosi, József and Van Vu. 'Near optimal bound for the distinct distances problem in high dimensions'. COMBINATORICA (2008): Solymosi, József and Csaba D. Tóth. 'On a question of Bourgain about geometric incidences' Combinatorics, Probability and Computing (2008):

2 11. Solymosi, József and Gábor Tardos. 'On the Number of k-rich Transformations '. 23rd Annual ACM Symposium on Computational Geometry. Gyeongju, Korea, Republic of. Jun, ACM Press New York, NY, USA. 12. Solymosi, József. 'Elementary additive combinatorics'. Additive Combinatorics. Lectures from the CRM-Clay School on Additive Combinatorics was held at the Universite de Montreal from March 30th to April 5th, Ed. Andrew Granville, Melvin Nathanson and József Solymosi. AMS, Laba, Izabella and József Solymosi. 'Incidence theorems for pseudoflats'. Discrete & Computational Geometry (2007): Haart, Derrick, Alex Iosevich and József Solymosi. 'Sum-product estimates in finite fields via Kloosterman sums'. INTERNATIONAL MATHEMATICS RESEARCH NOTICES (2007): Chang, Mei-Chu and József Solymosi. 'Sum-product theorems and incidence geometry'. JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY. 9.3 (2007): Graham, Ron and József Solymosi. 'Monochromatic equilateral right triangles on the integer grid'. Topics in Discrete Mathematics. (Dedicated to Jarik Nešetril on the occasion of his 60th birthday)series: Algorithms and Combinatorics. Vol. 26. Ed. Martin Klazar, Jan Kratochvil, Martin Loebl, Jirka Matousek, Robin Thomas and Pavel Valtr. Springer, Solymosi, József. 'Dense arrangements are locally very dense I'. SIAM JOURNAL ON DISCRETE MATHEMATICS (2006): Solymosi, József and Csaba D. Tóth. 'On distinct distances in homogeneous sets in the Euclidean space'. Discrete & Computational Geometry (2006): Solymosi, József. 'Arithmetic Progressions in Sets with Small Sumsets'. Combinatorics, Probability and Computing. 15 (2006):

3 20. Károlyi, Gyula and József Solymosi. 'Erdős-Szekeres theorem with forbidden order types'. Journal of Combinatorial Theory, Series A (2006): Adamy, Udo, Michael Hoffmann, József Solymosi and Milos Stojakovic. 'Coloring octrees'. THEORETICAL COMPUTER SCIENCE (2006): Solymosi, József. 'On the number of sums and products'. The Bulletin of the London Mathematical Society (2005): Solymosi, József. 'Regularity, uniformity, and quasirandomness'. Proceedings of the National Academy of Sciences of the United States of America (2005): Cooper, Joshua N. and József Solymosi. 'Collinear points in permutations'. Annals of Combinatorics. 9.2 (2005): Solymosi, József. 'On sum-sets and product-sets of complex numbers'. Journal de Theorie des Nombres de Bordaux (2005): Nesetril, Jaroslav, József Solymosi and Pavel Valtr. 'A Ramsey property of planar graphs'. Towards a theory of geometric graphs; Contemp. Math.. Vol Ed. Amer. Math. Soc, Solymosi, József and Van Vu. 'Distinct distances in high dimensional homogeneous sets'. Towards a theory of geometric graphs; Contemp. Math.. Vol Ed. Amer. Math. Soc, Solymosi, József. 'A note on a question of Erdős and Graham'. Combinatorics, Probability and Computing (2004): Adamy, Udo, Michael Hoffmann, József Solymosi and Milos Stojakovic. 'Coloring octrees'. Computing and combinatorics; Lecture Notes in Comput. Sci.. Vol Ed. Springer, Solymosi, József. 'Note on a generalization of Roth's theorem'. Discrete and computational geometry; Algorithms Combin. Vol. 25. Ed. János Pach. Springer,

4 31. Solymosi, József. 'Note on integral distances'. Discrete and Computational Geometry (2003): Gartner, Bernd, Falk Tschirschnitz, Emo Welzl, József Solymosi and Pavel Valtr. 'One line and n points'. Random Structures & Algorithms (2003): Pach, János, József Solymosi and Géza Tóth. 'Unavoidable configurations in complete topological graphs'. Discrete & Computational Geometry (2003): Solymosi, József and Van Vu. 'Distances in Homogeneous Sets'. Proceeding of the 19th ACM Symposium on Computational Geometry. 19th ACM Symposium on Computational Geometry. San Diego, California, United States ACM Press. 35. Gyárfás, András, Alice Hubenko and József Solymosi. 'Large cliques in C_4-free graphs'. COMBINATORICA (2002): Károlyi, Gyula and József Solymosi. 'Almost disjoint triangles in 3- space'. Discrete & Computational Geometry (2002): Solymosi, József, Gábor Tardos and Csaba D. Tóth. 'The k most frequent distances in the plane'. Discrete & Computational Geometry (2002): Pach, János and József Solymosi. 'Crossing patterns of segments'. Journal of Combinatorial Theory.Series A (2001): Alon, Noga, János Pach and József Solymosi. 'Ramsey-type theorems with forbidden subgraphs'. COMBINATORICA (2001): Pach, János and József Solymosi. 'Structure theorems for systems of segments'. Discrete and computational geometry (Tokyo, 2000); Lecture Notes in Comput. Sci. Vol Ed. Jin Akijama. Springer, Solymosi, József and Csaba D. Tóth. 'Different distances in a planar point set'. Proc. 17th ACM Symp. on Comput. Geom. (Medford, MA, 2001). 17th ACM Symp. on Comput. Geom. Medford, Massachusetts, United States ACM Press.

5 42. Nesetril, Jaroslav, József Solymosi and Pavel Valtr. 'Induced monochromatic subconfigurations'. Contemporary trends in discrete mathematics Stirin Castle, 1997); DIMACS Ser. Discrete Math. Theoret. Comput. Sci. Vol. 49. Ed. Amer. Math. Soc, Pach, János and József Solymosi. 'Halving lines and perfect crossmatchings'. Advances in discrete and computational geometry (South Hadley, MA, 1996); Contemp. Math. Vol Ed. Amer. Math. Soc, Pach, János and József Solymosi. 'Canonical theorems for convex sets'. Discrete & Computational Geometry. 19.3, Special Issue (1998): Könyv: 45. Additive Combinatorics. Lectures from the CRM-Clay School on Additive Combinatorics, was held at the Universite de Montreal from March 30th to April 5th, Ed. Andrew Granville, Melvin Nathanson and József Solymosi. AMS, pages, ISBN-13: További publikációk: 46. Solymosi, József. 'The sum-product problem'. OBERWOLFACH REPORTS. 44. (2008): Károlyi, Gyula, József Solymosi, and Géza Tóth. Forbidden order types. OBERWOLFACH REPORTS. 44. (2008): Solymosi, József. On Applications of the Hypergraph Removal Lemma'. OBERWOLFACH REPORTS. 3.1(2006): Solymosi, József. 'Geometry in Additive Combinatorics'. OBERWOLFACH REPORTS. 2.2 (2005): Solymosi, József. 'A simple counting method'. Proceedings Editor: Fiala, Jiri. Proceedings of Spring School in Combinatorics. Spring School in Combinatorics. Borova Lada, Czech Republic. Apr, DIMATIA. Prague. 51. Solymosi, József. 'Integral distances in the plane'. Proceedings Editor: Kratochvil, Jan. Proceedings of Fifth Prague Combinatorial Workshop. Prague, Czech Republic. Jul, DIMATIA. Prague. Disszertációk: 52. Solymosi, József. Ramsey-type results on planar geometric objects, Ph.D. Thesis, Swiss Federal Institute of Technology, ETH Zurich, Solymosi, József. Combinatorial problems in finite Ramsey theory, Master's Thesis, Eötvös Lorand University, Budapest, 1988.