default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJózsef Solymosi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j47]József Solymosi
:
On the Structure of Pointsets with Many Collinear Triples. Discret. Comput. Geom. 72(2): 986-1009 (2024)- [j46]József Solymosi, Ethan Patrick White:
Concyclic Intervals in the Plane. Discret. Comput. Geom. 72(2): 1010-1027 (2024) - [j45]József Solymosi:
Wickets in 3-uniform hypergraphs. Discret. Math. 347(6): 114029 (2024) - [j44]Gabriel Currier, József Solymosi, Ethan Patrick White:
Additive structure in convex translates. Eur. J. Comb. 118: 103889 (2024) - [j43]József Solymosi:
Integral and rational graphs in the plane. Graphs Comb. 40(6): 107 (2024) - [j42]József Solymosi, Joshua Zahl:
Improved Elekes-Szabó type estimates using proximity. J. Comb. Theory A 201: 105813 (2024) - 2023
- [j41]Daniel Di Benedetto, József Solymosi, Ethan Patrick White:
Combinatorics of Intervals in the Plane I: Trapezoids. Discret. Comput. Geom. 69(1): 232-249 (2023) - [j40]Orit E. Raz, József Solymosi:
Dense Graphs Have Rigid Parts. Discret. Comput. Geom. 69(4): 1079-1094 (2023) - 2022
- [i7]József Solymosi, Joshua Zahl:
Improved Elekes-Szabó type estimates using proximity. CoRR abs/2211.13294 (2022) - 2021
- [j39]Daniel Di Benedetto, József Solymosi, Ethan Patrick White:
On the Directions Determined by a Cartesian Product in an Affine Galois Plane. Comb. 41(6): 755-763 (2021) - [j38]József Solymosi, Ethan Patrick White, Chi Hoi Yip:
On the number of distinct roots of a lacunary polynomial over finite fields. Finite Fields Their Appl. 72: 101820 (2021) - [j37]Ilya D. Shkredov, József Solymosi:
The Uniformity Conjecture in Additive Combinatorics. SIAM J. Discret. Math. 35(1): 307-321 (2021) - 2020
- [j36]József Solymosi, Ching Wong:
The Brown-Erdős-Sós conjecture in finite abelian groups. Discret. Appl. Math. 276: 155-160 (2020) - [c10]Orit E. Raz, József Solymosi:
Dense Graphs Have Rigid Parts. SoCG 2020: 65:1-65:13 - [i6]Daniel Di Benedetto, József Solymosi, Ethan Patrick White:
Combinatorics of intervals in the plane I: trapezoids. CoRR abs/2005.09003 (2020)
2010 – 2019
- 2019
- [j35]József Solymosi, Ethan Patrick White:
On Rigidity of Unit-Bar Frameworks. Graphs Comb. 35(5): 1147-1152 (2019) - 2017
- [j34]Radoslav Fulek, Hossein Nassajian Mojarrad, Márton Naszódi, József Solymosi, Sebastian U. Stich, May Szedlák:
On the existence of ordinary triangles. Comput. Geom. 66: 28-31 (2017) - [j33]József Solymosi, Ching Wong:
Cycles in graphs of fixed girth with large size. Eur. J. Comb. 62: 124-131 (2017) - [j32]David Solymosi, József Solymosi:
Small cores in 3-uniform hypergraphs. J. Comb. Theory B 122: 897-910 (2017) - [i5]Kristina Nelson, József Solymosi, Foster Tom, Ching Wong:
The number of rational points of hyperelliptic curves over subsets of finite fields. CoRR abs/1710.02781 (2017) - 2016
- [j31]Micha Sharir, József Solymosi:
Distinct Distances from Three Points. Comb. Probab. Comput. 25(4): 623-632 (2016) - [i4]Zeev Dvir, Ankit Garg, Rafael Oliveira, József Solymosi:
Rank bounds for design matrices with block entries and geometric applications. CoRR abs/1610.08923 (2016) - 2015
- [j30]József Solymosi:
The (7, 4)-Conjecture in Finite Groups. Comb. Probab. Comput. 24(4): 680-686 (2015) - [j29]Orit E. Raz, Micha Sharir, József Solymosi:
On Triple Intersections of Three Families of Unit Circles. Discret. Comput. Geom. 54(4): 930-953 (2015) - [i3]József Solymosi, Joshua Zahl:
New bounds on curve tangencies and orthogonalities. CoRR abs/1509.05821 (2015) - 2014
- [c9]Orit E. Raz, Micha Sharir, József Solymosi:
On triple intersections of three families of unit circles. SoCG 2014: 198 - [c8]Orit E. Raz, Micha Sharir, József Solymosi:
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. SoCG 2014: 251 - [p1]Ryan Schwartz, József Solymosi:
Combinatorial applications of the subspace theorem. Geometry, Structure and Randomness in Combinatorics 2014: 123-140 - [i2]Orit E. Raz, Micha Sharir, József Solymosi:
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited. CoRR abs/1401.7419 (2014) - 2013
- [j28]József Solymosi, Milos Stojakovic:
Many Collinear k-Tuples with no k+1 Collinear Points. Discret. Comput. Geom. 50(3): 811-820 (2013) - [j27]József Solymosi:
Roth-type theorems in finite groups. Eur. J. Comb. 34(8): 1454-1458 (2013) - [j26]Ryan Schwartz, József Solymosi, Frank de Zeeuw:
Extensions of a result of Elekes and Rónyai. J. Comb. Theory A 120(7): 1695-1713 (2013) - [j25]Micha Sharir, Adam Sheffer, József Solymosi:
Distinct distances on two lines. J. Comb. Theory A 120(7): 1732-1736 (2013) - 2012
- [j24]János Pach, Gábor Tardos, József Solymosi:
Remarks on a Ramsey theory for trees. Comb. 32(4): 473-482 (2012) - [j23]József Solymosi, Terence Tao:
An Incidence Theorem in Higher Dimensions. Discret. Comput. Geom. 48(2): 255-280 (2012) - 2011
- [i1]József Solymosi, Milos Stojakovic:
Many collinear k-tuples with no k+1 collinear points. CoRR abs/1107.0327 (2011) - 2010
- [j22]József Solymosi, Frank de Zeeuw:
On a Question of Erdos and Ulam. Discret. Comput. Geom. 43(2): 393-401 (2010) - [j21]Ron Graham, József Solymosi:
Some Ramsey-type results for the n-cube. J. Comb. Theory A 117(2): 189-195 (2010) - [j20]János Pach, József Solymosi, Gábor Tardos:
Crossing numbers of imbalanced graphs. J. Graph Theory 64(1): 12-21 (2010)
2000 – 2009
- 2008
- [j19]József Solymosi, Van H. Vu:
Near optimal bounds for the Erdös distinct distances problem in high dimensions. Comb. 28(1): 113-125 (2008) - [j18]József Solymosi, Csaba D. Tóth:
On a Question of Bourgain about Geometric Incidences. Comb. Probab. Comput. 17(4): 619-625 (2008) - [j17]József Solymosi, Konrad J. Swanepoel:
Elementary Incidence Theorems for Complex Numbers and Quaternions. SIAM J. Discret. Math. 22(3): 1145-1148 (2008) - 2007
- [j16]Izabella Laba, József Solymosi:
Incidence Theorems for Pseudoflats. Discret. Comput. Geom. 37(2): 163-174 (2007) - [c7]József Solymosi, Gábor Tardos:
On the number of k-rich transformations. SCG 2007: 227-231 - 2006
- [j15]József Solymosi:
Arithmetic Progressions in Sets with Small Sumsets. Comb. Probab. Comput. 15(4): 597-603 (2006) - [j14]József Solymosi, Csaba D. Tóth:
Distinct Distances in Homogeneous Sets in Euclidean Space. Discret. Comput. Geom. 35(4): 537-549 (2006) - [j13]Gyula Károlyi, József Solymosi:
Erdos-Szekeres theorem with forbidden order types. J. Comb. Theory A 113(3): 455-465 (2006) - [j12]József Solymosi:
Dense Arrangements are Locally Very Dense. I. SIAM J. Discret. Math. 20(3): 623-627 (2006) - [j11]Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic:
Coloring octrees. Theor. Comput. Sci. 363(1): 11-17 (2006) - 2004
- [j10]József Solymosi:
A Note on a Question of Erdos and Graham. Comb. Probab. Comput. 13(2): 263-267 (2004) - [c6]Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic:
Coloring Octrees. COCOON 2004: 62-71 - 2003
- [j9]János Pach, József Solymosi, Géza Tóth:
Unavoidable Configurations in Complete Topological Graphs. Discret. Comput. Geom. 30(2): 311-320 (2003) - [j8]József Solymosi:
Note on Integral Distances. Discret. Comput. Geom. 30(2): 337-342 (2003) - [c5]József Solymosi, Van H. Vu:
Distinct distances in homogeneous sets. SCG 2003: 104-105 - 2002
- [j7]András Gyárfás, Alice Hubenko, József Solymosi:
Large Cliques in C4-Free Graphs. Comb. 22(2): 269-274 (2002) - [j6]Gyula Károlyi, József Solymosi:
Almost Disjoint Triangles in 3-Space. Discret. Comput. Geom. 28(4): 577-583 (2002) - [j5]József Solymosi, Gábor Tardos, Csaba D. Tóth:
The k Most Frequent Distances in the Plane. Discret. Comput. Geom. 28(4): 639-648 (2002) - 2001
- [j4]Noga Alon, János Pach, József Solymosi:
Ramsey-type Theorems with Forbidden Subgraphs. Comb. 21(2): 155-170 (2001) - [j3]József Solymosi, Csaba D. Tóth:
Distinct Distances in the Plane. Discret. Comput. Geom. 25(4): 629-634 (2001) - [j2]János Pach, József Solymosi:
Crossing Patterns of Segments. J. Comb. Theory A 96(2): 316-325 (2001) - [c4]József Solymosi, Csaba D. Tóth:
On the distinct distances determined by a planar point set. SCG 2001: 29-32 - [c3]Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr:
One line and n points. STOC 2001: 306-315 - 2000
- [c2]János Pach, József Solymosi:
Structure Theorems for Systems of Segments. JCDCG 2000: 308-317
1990 – 1999
- 1998
- [j1]János Pach, József Solymosi:
Canonical Theorems for Convex Sets. Discret. Comput. Geom. 19(3): 427-435 (1998) - 1997
- [c1]Jaroslav Nesetril, József Solymosi, Pavel Valtr:
Induced monochromatic subconfigurations. Contemporary Trends in Discrete Mathematics 1997: 219-227
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
