Distinct Distances from Three Points

DOI10.1017/S0963548315000231zbMath1372.52020arXiv1308.0814OpenAlexW3099831362MaRDI QIDQ5366908

Micha Sharir, József Solymosi

Publication date: 10 October 2017

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

Full work available at URL: https://arxiv.org/abs/1308.0814

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Erd?s problems and related topics of discrete geometry (52C10) Combinatorial complexity of geometric structures (52C45)

Related Items (8)

The Elekes-Szabó problem and the uniformity conjecture ⋮ On bipartite distinct distances in the plane ⋮ Improved Elekes-Szabó type estimates using proximity ⋮ Incidence problems in harmonic analysis, geometric measure theory, and ergodic theory. Abstracts from the workshop held June 4--9, 2023 ⋮ On the dimension of exceptional parameters for nonlinear projections, and the discretized Elekes-Rónyai theorem ⋮ Few distinct distances implies no heavy lines or circles ⋮ On triple intersections of three families of unit circles ⋮ Distinct Distances on Algebraic Curves in the Plane

Cites Work

• On the graph of large distances
• A combinatorial problem on polynomials and rational functions
• How to find groups?
• Distinct distances on two lines
• A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have?
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• On the Number of Incidences Between Points and Curves

This page was built for publication: Distinct Distances from Three Points