A combinatorial distinction between unit circles and straight lines: how many coincidences can they have?

DOI10.1017/S0963548309990265MaRDI QIDQ3552498zbMATH OpenOpenAlexFDO

Authors György Elekes, Endre Szabó, Miklós Simonovits

Publication date 22 April 2010

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548309990265

zbMATH Keywords

incidence graphtriple pointochard problemparametrized family of curvessurface theoremSzmerédi-Trotter bound

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Other problems of combinatorial convexity (52A37) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30) Configuration theorems in linear incidence geometry (51A20)

Recommendations

• scientific article; zbMATH DE number 4017769
• At least \(n - 1\) intersection points in a connected family of \(n\) unit circles in the plane
• Incidences between points and curves with almost two degrees of freedom

Cites work

• Arrangements of Lines with a Large Number of Triangles
• Circle grids and bipartite graphs of distances
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Extremal problems in discrete geometry
• Repeated angles in the plane and related problems
• n points in the plane can determine \(n^{3/2}\) unit circles

Cited in

(2)

• Improved Elekes-Szabó type estimates using proximity
• Distinct distances from three points

This page was built for publication: A combinatorial distinction between unit circles and straight lines: how many coincidences can they have?

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