Erdős’s Unit Distance Problem

2016/01/01 by Endre Szemerédi · 6 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computer science #Limits and Structures in Graph Theory #Mathematics #Mathematics education #Unit (ring theory)

paper · doi:10.1007/978-3-319-32162-2_15

published in Open Problems in Mathematics, 459-477 (Springer International Publishing)

crossref issued 2016/01/01 · crossref published 2016/01/01 · crossref published-print 2016/01/01 · openalex publication_date 2016/01/01 · crossref created 2016/07/05 · crossref published-online 2016/07/06 · crossref deposited 2019/09/10 · openalex created_date 2025/10/10 · crossref indexed 2026/01/20 · openalex updated_date 2026/08/04

Citations

• Drei Sätze über die n-dimensionale euklidische Sphäre
• On the number of sums and products
• A sum-product estimate in finite fields, and applications
• Unit distances and diameters in Euclidean spaces
• Combinatorial complexity bounds for arrangements of curves and spheres
• Forbidden paths and cycles in ordered graphs and matrices
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• A 64-dimensional two-distance counterexample to Borsuk's conjecture
• ON THE NUMBER OF SUMS AND PRODUCTS

Cited by

• An Improved Constant Factor for the Unit Distance Problem
• Unit distance graph [wikipedia]