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

DOI10.1007/BF02579212zbMATH Open0561.52009MaRDI QIDQ2266448FDOQ2266448

György Elekes

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

unit circlesn points in the plane

Mathematics Subject Classification ID

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

Cited In (5)

• Point sets with many unit circles
• 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?
• On the number of circles determined by \(n\) points in the Euclidean plane
• Circle grids and bipartite graphs of distances

   Recommendations

• Point sets with many unit circles 👍 👎
• Unit distances 👍 👎
• Title not available (Why is that?) 👍 👎
• On the number of circles determined by \(n\) points in the Euclidean plane 👍 👎
• Erdős’s Unit Distance Problem 👍 👎

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)