Corpus ID: 16310883

Crossing Numbers and Hard Erdős Problems in Discrete Geometry

@inproceedings{LASZ1997CrossingNA,
  title={Crossing Numbers and Hard Erdős Problems in Discrete Geometry},
  author={L L.ASZ and E O.A.Sz{\'e}K},
  year={1997}
}
We show that an old but not well-known lower bound for the crossing number of a graph yields short proofs for a number of bounds in discrete plane geometry which were considered hard before: the number of incidences among points and lines, the maximum number of unit distances among n points, the minimum number of distinct distances among n points. " A statement about curves is not interesting unless it is already interesting in the case of a circle. " (H. Steinhaus) The main aim of this paper… Expand
Incidence Problems in Plane and Higher Dimensions
Finite Point Configurations in the Plane, Rigidity and Erdős Problems
Computing crossing number in linear time
Crossing numbers of imbalanced graphs
New bounds on crossing numbers
Distinct Distances in Graph Drawings
The number of crossings in multigraphs with no empty lens
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Combinatorial complexity bounds for arrangements of curves and spheres
Extremal problems in discrete geometry
A Combinatorial Distinction Between the Euclidean and Projective Planes
Lower Bound for Crossing Nw~b~rs with Applications to K, ) K,, ( and
Improving Bounds for the Crossing Numbers on Surfaces of Genus g
The Number of Different Distances Determined by n Points in the Plane
  • F. Graham
  • Computer Science
  • J. Comb. Theory, Ser. A
  • 1984
The number of different distances determined by a set of points in the Euclidean plane
Repeated Angles in the Plane and Related Problems
On Sets of Distances of n Points
...
1
2
3
...