The maximum number of second smallest distances in finite planar sets

DOI10.1007/BF02187849MaRDI QIDQ1189287zbMATH OpenOpenAlexFDO

Authors Peter Brass

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

zbMATH Keywords

linear optimizationpoint sets in the planeunit distances

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Review text

Using linear optimization the author gives a bound on the maximum number of second smallest distances in an \(n\)-element point set. In the given bound the constant is best possible. Also a theorem which gives some structural information on the extremal sets is given.

Recommendations

• scientific article; zbMATH DE number 3896939
• The two largest distances in finite planar sets
• On large distances in planar sets
• scientific article; zbMATH DE number 426327

Cites work

• A Problem of Leo Moser About Repeated Distances on the Sphere
• Combinatorial complexity bounds for arrangements of curves and spheres
• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3896939 (Why is no real title available?)
• scientific article; zbMATH DE number 3512109 (Why is no real title available?)
• scientific article; zbMATH DE number 3893918 (Why is no real title available?)
• On large distances in planar sets
• On Sets of Distances of n Points
• On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
• Unit distances

Cited in

(11)

• On large distances in planar sets
• On the second smallest distance between finitely many points on the sphere
• The multiplicity of the two smallest distances among points
• The two largest distances in finite planar sets
• On the Erdös-diameter of sets
• The shortest distance among points in general position.
• scientific article; zbMATH DE number 426327 (Why is no real title available?)
• scientific article; zbMATH DE number 3896939 (Why is no real title available?)
• Small distances in convex polygons
• General penny graphs are at most \(\frac{43}{18}\)-dense
• Minimum planar sets with maximum equidistance counts

This page was built for publication: The maximum number of second smallest distances in finite planar sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189287)