The number of unit distances is almost linear for most norms

DOI10.1016/j.aim.2010.09.009zbMath1214.52005arXiv1007.1095OpenAlexW1993744948MaRDI QIDQ624331

Ji{ří} Matoušek

Publication date: 9 February 2011

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Baire categoryextremal graph theoryErdős unit distance problem

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Density (toughness, etc.) (05C42)

Related Items (8)

Distinct distances with \(\ell_p\) metrics ⋮ RATIONAL DISTANCES WITH RATIONAL ANGLES ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ Classification of maps sending lines into translates of a curve ⋮ On the pinned distances problem in positive characteristic ⋮ Additive structure in convex translates ⋮ On the number of discrete chains ⋮ Crescent configurations in normed spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Some new results on smoothness and rotundity in normed linear spaces
• A combinatorial distinction between the Euclidean and projective planes
• Combinatorial complexity bounds for arrangements of curves and spheres
• Cutting circles into pseudo-segments and improved bounds for incidences
• RATIONAL DISTANCES WITH RATIONAL ANGLES
• Research Problems in Discrete Geometry
• How Many Points Can Be Reconstructed from k Projections?
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Convex and Discrete Geometry
• On Sets of Distances of n Points

This page was built for publication: The number of unit distances is almost linear for most norms