Crossing Numbers and Hard Erdős Problems in Discrete Geometry
1997 ◽
Vol 6
(3)
◽
pp. 353-358
◽
Keyword(s):
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.
2020 ◽
Vol 29
(04)
◽
pp. 2050019
Keyword(s):
2020 ◽
Vol 29
(04)
◽
pp. 2050022
2012 ◽
Vol 21
(3)
◽
pp. 358-373
◽
Keyword(s):
2016 ◽
Vol 164
(1)
◽
pp. 147-178
◽
Keyword(s):
Keyword(s):
Keyword(s):