Hostname: page-component-5db58dd55d-ggg9q Total loading time: 0 Render date: 2026-05-25T20:41:07.441Z Has data issue: false hasContentIssue false
  • English
  • Français

Nearly Equal Distances in the Plane

Published online by Cambridge University Press:  12 September 2008

Paul Erdős ,
Endre Makai  and
János Pach
Paul Erdős
Affiliation:
Mathematical Institute of the Hungarian Academy of Sciences
Endre Makai
Affiliation:
Mathematical Institute of the Hungarian Academy of Sciences
János Pach
Affiliation:
Department of Computer Science, City College, New York, and Mathematical Institute of the Hungarian Academy of Sciences
Get access Rights & Permissions [Opens in a new window]

Abstract

For any positive integer k and ε > 0, there exist nk,ε, ck, e > 0 with the following property. Given any system of n > nk,ε points in the plane with minimal distance at least 1 and any t1, t2…, tk ≥ 1, the number of those pairs of points whose distance is between ti and for some 1 ≤ i ≤ k, is at most (n2/2) (1 − 1/(k+1)+ε). This bound is asymptotically tight.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 2 , Issue 4 , December 1993 , pp. 401 - 408
Copyright
Copyright © Cambridge University Press 1993

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.)

Article purchase

Temporarily unavailable

References

[1]Erdős, P. (1946) On sets of distances of n points. Amer. Math. Monthly 53, 248–250.Google Scholar
[2]Erdős, P. (1965) On extremal problems for graphs and generalized graphs. Israel J. Math. 2, 183–190.Google Scholar
[3]Erdős, P., Makai, E., Pach, J. and Spencer, J. (1991) Gaps in difference sets and the graph of nearly equal distances. In: Gritzmann, P. and Sturmfels, B. (eds.) Applied Geometry and Discrete Mathematics, the Victor Klee Festschrift, DIMACS Series 4, AMS-ACM, 265–273.CrossRefGoogle Scholar
[4]Erdős, P. and Purdy, G. (to appear) Some extremal problems in combinatorial geometry. In: Handbook of Combinatorics, Springer-Verlag.Google Scholar
[5]Lovász, L. (1979) Combinatorial problems and exercises, Akad. Kiadó, Budapest, North Holland, Amsterdam—New York—Oxford.Google Scholar
[6]Moser, W. and Pach, J. (1993) Recent developments in combinatorial geometry. In: Pach, J. (ed.) New Trends in Discrete and Computational Geometry, Springer-Verlag, Berlin281–302.Google Scholar
[7]Pach, J. and Agarwal, P. K. (to appear) Combinatorial Geometry, J. Wiley, New York.CrossRefGoogle Scholar
[8]Szemerédi, E. (1978) Regular partitions of graphs. In: Problemes Combinatoires el Théorie de Graphes, Proc. Colloq. Internat. CNRS, Paris399–401.Google Scholar
[9]Turán, P. (1941) Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436–452. (Hungarian, German summary.)Google Scholar