The maximum number of second smallest distances in finite planar sets
From MaRDI portal
Publication:1189287
DOI10.1007/BF02187849zbMath0749.52012MaRDI QIDQ1189287
Publication date: 26 September 1992
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131202
52C10: Erd?s problems and related topics of discrete geometry
Related Items
Small distances in convex polygons, The multiplicity of the two smallest distances among points, On the Erdös-diameter of sets, The shortest distance among points in general position.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
- Unit distances
- Combinatorial complexity bounds for arrangements of curves and spheres
- On large distances in planar sets
- A Problem of Leo Moser About Repeated Distances on the Sphere
- On Sets of Distances of n Points