Nearly \(k\)-distance sets

MaRDI QIDQ6621202

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)

Cites Work

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

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)