Almost-equidistant sets

DOI10.1007/s00373-020-02149-wzbMath1439.52016arXiv1706.06375OpenAlexW3007385743MaRDI QIDQ2175803

Attila Pór, Manfred Scheucher, Martin Balko, Pavel Valtr, Konrad J. Swanepoel

Publication date: 30 April 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

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 ⋮ Approximate inverse limits and (m,n)-dimensions ⋮ Matching random colored points with rectangles

Uses Software

• OEIS
• Triangleramsey

Cites Work

• Unnamed Item
• Unnamed Item
• The minimum semidefinite rank of a triangle-free graph
• Cycles of nonzero elements in low rank matrices
• A note on Ramsey numbers
• Sets of vectors with many orthogonal pairs
• Large sets of nearly orthogonal vectors
• Small Ramsey numbers
• Problems and results in extremal combinatorics. I.
• The generation of maximal triangle-free graphs
• On almost-equidistant sets
• On the space chromatic number
• Ramsey numbers \(R(K_3, G)\) for graphs of order 10
• Almost-equidistant sets
• Isomorph-Free Exhaustive Generation
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Bounding the Size of an Almost-Equidistant Set in Euclidean Space
• The realization of distances within sets in Euclidean space
• Almost equidistant points on \(S^{D-1}\)

This page was built for publication: Almost-equidistant sets