Circle grids and bipartite graphs of distances

DOI10.1007/BF01200753zbMath0827.52010OpenAlexW2043987727MaRDI QIDQ1894698

György Elekes

Publication date: 11 December 1995

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

distancesgeometric graphspoint sets

Mathematics Subject Classification ID

Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (9)

The Elekes-Szabó problem and the uniformity conjecture ⋮ On distinct distances between a variety and a point set ⋮ On bipartite distinct distances in the plane ⋮ Distinct angle problems and variants ⋮ Distinct distances on non-ruled surfaces and between circles ⋮ On the dimension of exceptional parameters for nonlinear projections, and the discretized Elekes-Rónyai theorem ⋮ On the graph of large distances ⋮ A Combinatorial Distinction Between Unit Circles and Straight Lines: How Many Coincidences Can they Have? ⋮ How to find groups?

Cites Work

• On the graph of large distances
• n points in the plane can determine \(n^{3/2}\) unit circles

This page was built for publication: Circle grids and bipartite graphs of distances