Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-05T19:42:09.415Z 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: [email protected])
Get access Rights & Permissions [Opens in a new window]

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.

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

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)