József Solymosi

Orcid: 0000-0001-9181-0866

According to our database1, József Solymosi authored at least 53 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improved Elekes-Szabó type estimates using proximity.
J. Comb. Theory, Ser. A, January, 2024

2023
Dense Graphs Have Rigid Parts.
Discret. Comput. Geom., June, 2023

Combinatorics of Intervals in the Plane I: Trapezoids.
Discret. Comput. Geom., 2023

2021
The Uniformity Conjecture in Additive Combinatorics.
SIAM J. Discret. Math., 2021

On the number of distinct roots of a lacunary polynomial over finite fields.
Finite Fields Their Appl., 2021

On the Directions Determined by a Cartesian Product in an Affine Galois Plane.
Comb., 2021

2020
The Brown-Erdős-Sós conjecture in finite abelian groups.
Discret. Appl. Math., 2020

2019
On Rigidity of Unit-Bar Frameworks.
Graphs Comb., 2019

2017
Small cores in 3-uniform hypergraphs.
J. Comb. Theory, Ser. B, 2017

Cycles in graphs of fixed girth with large size.
Eur. J. Comb., 2017

The number of rational points of hyperelliptic curves over subsets of finite fields.
CoRR, 2017

On the existence of ordinary triangles.
Comput. Geom., 2017

2016
Distinct Distances from Three Points.
Comb. Probab. Comput., 2016

Rank bounds for design matrices with block entries and geometric applications.
CoRR, 2016

2015
On Triple Intersections of Three Families of Unit Circles.
Discret. Comput. Geom., 2015

The (7, 4)-Conjecture in Finite Groups.
Comb. Probab. Comput., 2015

New bounds on curve tangencies and orthogonalities.
CoRR, 2015

2014
Polynomials vanishing on grids: The Elekes-Rónyai problem revisited.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Combinatorial applications of the subspace theorem.
Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014

2013
Distinct distances on two lines.
J. Comb. Theory, Ser. A, 2013

Extensions of a result of Elekes and Rónyai.
J. Comb. Theory, Ser. A, 2013

Roth-type theorems in finite groups.
Eur. J. Comb., 2013

Many Collinear k-Tuples with no k+1 Collinear Points.
Discret. Comput. Geom., 2013

2012
An Incidence Theorem in Higher Dimensions.
Discret. Comput. Geom., 2012

Remarks on a Ramsey theory for trees.
Comb., 2012

2010
Crossing numbers of imbalanced graphs.
J. Graph Theory, 2010

Some Ramsey-type results for the n-cube.
J. Comb. Theory, Ser. A, 2010

On a Question of Erdos and Ulam.
Discret. Comput. Geom., 2010

2008
Elementary Incidence Theorems for Complex Numbers and Quaternions.
SIAM J. Discret. Math., 2008

On a Question of Bourgain about Geometric Incidences.
Comb. Probab. Comput., 2008

Near optimal bounds for the Erdös distinct distances problem in high dimensions.
Comb., 2008

2007
Incidence Theorems for Pseudoflats.
Discret. Comput. Geom., 2007

On the number of k-rich transformations.
Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006
Coloring octrees.
Theor. Comput. Sci., 2006

Dense Arrangements are Locally Very Dense. I.
SIAM J. Discret. Math., 2006

Erdos-Szekeres theorem with forbidden order types.
J. Comb. Theory, Ser. A, 2006

Distinct Distances in Homogeneous Sets in Euclidean Space.
Discret. Comput. Geom., 2006

Arithmetic Progressions in Sets with Small Sumsets.
Comb. Probab. Comput., 2006

2004
A Note on a Question of Erdos and Graham.
Comb. Probab. Comput., 2004

2003
Note on Integral Distances.
Discret. Comput. Geom., 2003

Unavoidable Configurations in Complete Topological Graphs.
Discret. Comput. Geom., 2003

Distinct distances in homogeneous sets.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
The k Most Frequent Distances in the Plane.
Discret. Comput. Geom., 2002

Almost Disjoint Triangles in 3-Space.
Discret. Comput. Geom., 2002

Large Cliques in <i>C</i><sub>4</sub>-Free Graphs.
Comb., 2002

2001
Crossing Patterns of Segments.
J. Comb. Theory, Ser. A, 2001

Distinct Distances in the Plane.
Discret. Comput. Geom., 2001

Ramsey-type Theorems with Forbidden Subgraphs.
Comb., 2001

One line and n points.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

On the distinct distances determined by a planar point set.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

2000
Structure Theorems for Systems of Segments.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1998
Canonical Theorems for Convex Sets.
Discret. Comput. Geom., 1998

1997
Induced monochromatic subconfigurations.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997


  Loading...