Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-07T19:03:41.070Z Has data issue: false hasContentIssue false
  • English
  • Français

Crossing Numbers and Hard Erdős Problems in Discrete Geometry

Published online by Cambridge University Press:  01 September 1997

LÁSZLÓ A. SZÉKELY
LÁSZLÓ A. SZÉKELY
Affiliation:
Department of Mathematics, University of South Carolina, Columbia, SC 29208, USA (e-mail: laszlo@math.sc.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 3 , September 1997 , pp. 353 - 358
Copyright
1997 Cambridge University Press