Crossing numbers and hard Erdős problems in discrete geometry (1997)

by László A. Székely
Venue:COMBINATORICS, PROBABILITY AND COMPUTING
Citations:111 - 1 self

Active Bibliography

6 Erdős on Unit Distances and the Szemeredi-Trotter Theorems – László A. Székely
16 Distinct Distances in the Plane – J. Solymosi, Cs. D. Toth - 2001
2 Cardinalities Of K-Distance Sets In Minkowski Spaces – K. J. Swanepoel - 1997
For any n points in the plane: (a) There are n 0.66 distinct distances (b) There are n 0.8 distinct distances – William Gasarch
For any n points in the plane: (a) There are n^0.66 distinct distances (b) There are n^0.8 distinct distances – William Gasarch
The Beginnings of Geometric Graph Theory – János Pach
5 Extremal problems on triangle areas in two and three dimensions – Adrian Dumitrescu, Micha Sharir, Csaba D. Tóth - 2008
13 On Distinct Sums and Distinct Distances – Gábor Tardos - 2001
On Distinct Distances and Incidences: Elekes’s Transformation and the New Algebraic Developments ∗ – Micha Sharir - 2010
10 Incidences in Three Dimensions and Distinct Distances in the Plane (Extended Abstract) – György Elekes, Micha Sharir - 2010
On distinct distances among points in general position and . . . – Adrian Dumitrescu - 2008
New Results on the Distribution of Distances Determined By Separated Point Sets – E. Makai, Jr., J. Pach, J. Spencer
2 On the crossing number of complete graphs: Growing minimal Kn from minimal Kn−1 – Judith R. Fredrickson - 2006
Optimal Crossing Minimization . . . – Dietmar Ebner - 2005
New – E. Makai Jr. J. Pach
2 The k Most Frequent Distances in the Plane – Jozsef Solymosi, Gabor Tardos, Csaba D. Toth
8 Isosceles Triangles Determined By a Planar Point Set – János Pach, Gábor Tardos
25 Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs – János Pach, Gábor Tardos, Géza Tóth, et al. - 2006
28 Applications of the crossing number – János Pach - 1994