A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?

DOI10.1017/S0963548309990265zbMATH Open1193.52014OpenAlexW2166746278MaRDI QIDQ3552498FDOQ3552498

Endre Szabó, György Elekes, 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)

Cites Work

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

Cited In (3)

• Improved Elekes-Szabó type estimates using proximity
• Distinct Distances from Three Points
• On triple intersections of three families of unit circles

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)