Skip to main content
×
Home
    • Aa
    • Aa

Crossing Numbers and Hard Erdős Problems in Discrete Geometry

  • LÁSZLÓ A. SZÉKELY (a1)
    • Published online: 01 September 1997
Abstract

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.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 30 *
Loading metrics...

Abstract views

Total abstract views: 214 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th May 2017. This data will be updated every 24 hours.

Errata