The maximum number of second smallest distances in finite planar sets
type: Item
instance of: scholarly article
title: The maximum number of second smallest distances in finite planar sets
zbMATH Open document ID: 0749.52012
DOI: 10.1007/BF02187849
author: Peter Brass
published in: Discrete \& Computational Geometry
publication date: 1992-09-26T00:00:00Z
full work available at URL: https://eudml.org/doc/131202
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.
reviewed by: Hans-Dietrich Hecker
Mathematics Subject Classification ID: 52C10
zbMATH DE Number: 54915
zbMATH Keywords: unit distances
zbMATH Keywords: point sets in the plane
zbMATH Keywords: linear optimization
MaRDI profile type: Publication
cites work: On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry
cites work: Unit distances
cites work: Q3323698
cites work: Combinatorial complexity bounds for arrangements of curves and spheres
cites work: On Sets of Distances of n Points
cites work: A Problem of Leo Moser About Repeated Distances on the Sphere
cites work: Q4091941
cites work: Q5186278
cites work: On large distances in planar sets
cites work: Q3676148
OpenAlex ID: W2075551959
description: scientific article; zbMATH DE number 54915