Nearly k-distance sets

MaRDI QIDQ6621202zbMATH OpenFDO

Authors Nóra Frankl, Andrey B. Kupavskii

Publication date 18 October 2024

Published in Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Nearly k-distance sets
• Nearly Equal Distances in the Plane
• Distinct distances determined by subsets of a point set in space
• On almost-equidistant sets
• scientific article; zbMATH DE number 3153711

Cites work

• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• scientific article; zbMATH DE number 17642 (Why is no real title available?)
• scientific article; zbMATH DE number 1943971 (Why is no real title available?)
• Near optimal bounds for the Erdős distinct distances problem in high dimensions
• Nearly Equal Distances in the Plane
• On a lemma of Littlewood and Offord
• On extremal problems of graphs and generalized graphs
• On Sets of Distances of n Points
• On the Erdős distinct distances problem in the plane
• On the number of complete subgraphs and circuits contained in graphs

This page was built for publication: Nearly \(k\)-distance sets

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