The number of different distances determined by n points in the plane

The number of different distances determined by n points in the plane (1984)

by F. R. K. Chung

Venue:	J. Combin. Theory Ser. A
Citations:	17 - 0 self

Datum	Value	Source
TITLE	The number of different distances determined by n points in the plane	INFERENCE
AUTHOR NAME	F. R. K. Chung	SVM HeaderParse 0.2
AUTHOR AFFIL	; Bell Communications Research, Murray Hill; Communicated by the Managing Editors	SVM HeaderParse 0.2
AUTHOR ADDR	; New Jersey 07974	SVM HeaderParse 0.2
ABSTRACT	A classical problem in combinatorial geometry is that of determining the minimum number f(n) of different distances determined by n points in the Euclidean plane. In 1952, L. Moser proved thatf(n)> n”‘/(2 fi)- 1 and this has remained for 30 years as the best lower bound known for f(n). It is shown that f(n)> cn “ ’ for some fixed constant c. I.	SVM HeaderParse 0.2
YEAR	1984	INFERENCE
VENUE	J. Combin. Theory Ser. A	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	342--354	INFERENCE
VOLUME	36	INFERENCE
CITATIONS	6 found	ParsCit 1.0