n points in the plane can determine \(n^{3/2}\) unit circles (Q2266448): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: György Elekes / rank | |||
Property / reviewed by | |||
Property / reviewed by: Christoph Schulz / rank | |||
Property / author | |||
Property / author: György Elekes / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Christoph Schulz / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 07:30, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | n points in the plane can determine \(n^{3/2}\) unit circles |
scientific article |
Statements
n points in the plane can determine \(n^{3/2}\) unit circles (English)
0 references
1984
0 references
The paper deals with the following problem of P. Erdős: Given n points in the plane (no three collinear) draw a circle through each triple. How many of these circles can have unit radius? Erdős proved for the maximal number f(n) of these circuits \(c_ 1n\leq f(n)\leq n(n-1)\) for some constant \(c_ 1\). The author improves the lower bound to \(c_ 2\geq n^{3/2}\) by constructing an appropriate set of n points.
0 references
unit circles
0 references
n points in the plane
0 references