# 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

#### 191 Citations

The number of crossings in multigraphs with no empty lens

- Mathematics, Computer Science
- Graph Drawing
- 2018

#### References

SHOWING 1-10 OF 24 REFERENCES

Combinatorial complexity bounds for arrangements of curves and spheres

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 1990

Extremal problems in discrete geometry

- Mathematics, Computer Science
- Comb.
- 1983

A Combinatorial Distinction Between the Euclidean and Projective Planes

- Computer Science, Mathematics
- Eur. J. Comb.
- 1983

Improving Bounds for the Crossing Numbers on Surfaces of Genus g

- Mathematics, Computer Science
- WG
- 1993

On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry

- Mathematics, Computer Science
- Comb.
- 1983

The Number of Different Distances Determined by n Points in the Plane

- Computer Science
- J. Comb. Theory, Ser. A
- 1984

The number of different distances determined by a set of points in the Euclidean plane

- Computer Science, Mathematics
- Discret. Comput. Geom.
- 1992

Repeated Angles in the Plane and Related Problems

- Mathematics, Computer Science
- J. Comb. Theory, Ser. A
- 1992