Crossing numbers and hard Erdős problems in discrete geometry (1993)
Cached
Download Links
by
László A. Székely
| Citations: | 111 - 1 self |
BibTeX
@MISC{Székely93crossingnumbers,
author = {László A. Székely},
title = {Crossing numbers and hard Erdős problems in discrete geometry },
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that an old but not well-known lower bound for the crossing numberofa 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.
