Unit distances and diameters in Euclidean spaces

DOI10.1007/s00454-008-9082-xzbMath1162.52010arXiv0707.0213OpenAlexW2008824802MaRDI QIDQ1006401

Konrad J. Swanepoel

Publication date: 24 March 2009

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Stone theoremErdős-Simonovits stability theoremfrequent diameter problemLenz constructionunit distance problem

Mathematics Subject Classification ID

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

Related Items (16)

Configured polytopes and extremal configurations ⋮ On the maximum number of translates in a point set ⋮ On simplices in diameter graphs in \(\mathbb{R}^4\) ⋮ Nearly \(k\)-distance sets ⋮ On Schur's conjecture in \(\mathbb{R}^{4}\) ⋮ A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs ⋮ Classification of maps sending lines into translates of a curve ⋮ Ball polytopes and the Vázsonyi problem ⋮ Remarks on Schur's conjecture ⋮ Large simplices determined by finite point sets ⋮ DOUBLE‐NORMAL PAIRS IN SPACE ⋮ Proof of Schur's conjecture in \(\mathbb R^D\) ⋮ Diameter graphs in \({\mathbb R}^4\) ⋮ Double-normal pairs in the plane and on the sphere ⋮ On Schur's conjecture in \(\mathbb R^4\) ⋮ Exact stability for Turán’s Theorem

Cites Work

• Variations on the theme of repeated distances
• A new generalization of Mantel's theorem to \(k\)-graphs
• Combinatorial complexity bounds for arrangements of curves and spheres
• A new proof of Vázsonyi's conjecture
• On some metric and combinatorial geometric problems
• On finite sets in \(E^ k \)in which the diameter is frequently achieved
• The maximum number of unit distances among \(n\) points in dimension four
• Antipodality properties of finite sets in Euclidean space
• The Turán number of the Fano plane
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• A Problem of Leo Moser About Repeated Distances on the Sphere
• On Some Applications of Graph Theory to Geometry
• Triple Systems Not Containing a Fano Configuration
• On Sets of Distances of n Points
• On the structure of linear graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unit distances and diameters in Euclidean spaces