n points in the plane can determine n^3/2 unit circles

DOI10.1007/BF02579212MaRDI QIDQ2266448zbMATH OpenFDO

Authors György Elekes

Publication date 1984

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02579212

zbMATH Keywords

n points in the planeunit circles

Mathematics Subject Classification ID

Geometric constructions in real or complex geometry (51M15) Other problems of combinatorial convexity (52A37)

Review text

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.

Recommendations

• Point sets with many unit circles
• Unit distances
• scientific article; zbMATH DE number 3913161
• On the number of circles determined by \(n\) points in the Euclidean plane
• Erdős’s Unit Distance Problem

Cited in

(10)

• Point sets with many unit circles
• On the number of circles determined by \(n\) points in the Euclidean plane
• Circle grids and bipartite graphs of distances
• Points defining triangles with distinct circumradii
• At least \(n - 1\) intersection points in a connected family of \(n\) unit circles in the plane
• A combinatorial distinction between unit circles and straight lines: how many coincidences can they have?
• scientific article; zbMATH DE number 3913161 (Why is no real title available?)
• On the number of distinct radii of circles determined by triples and on parameters of other curves
• On a forgotten conjecture from a famous paper of Erdős
• Unit distances

This page was built for publication: n points in the plane can determine \(n^{3/2}\) unit circles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266448)