Bounding the Size of an Almost-Equidistant Set in Euclidean Space

DOI10.1017/S0963548318000287zbMath1435.52008arXiv1708.01590OpenAlexW3105800933WikidataQ129687401 ScholiaQ129687401MaRDI QIDQ5219320

Nabil H. Mustafa, Konrad J. Swanepoel, Andrey B. Kupavskii

Publication date: 11 March 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

point configuration\((M,D,\delta)\)-critical configurationalmost equidistant set

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10) Ramsey theory (05D10)

Related Items (3)

Almost-equidistant sets ⋮ On \(k\)-diametral point configurations in Minkowski spaces ⋮ On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)

Cites Work

• The minimum semidefinite rank of a triangle-free graph
• Cycles of nonzero elements in low rank matrices
• A note on Ramsey numbers
• On the space chromatic number
• The realization of distances within sets in Euclidean space
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounding the Size of an Almost-Equidistant Set in Euclidean Space