Proof of Schur's conjecture in \(\mathbb R^D\)

DOI10.1007/s00493-016-3340-yzbMath1399.52031arXiv1402.3694OpenAlexW2566875120WikidataQ122981317 ScholiaQ122981317MaRDI QIDQ722315

Andrey B. Kupavskii, Aleksandr A. Polyanskii

Publication date: 23 July 2018

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

cliquesdiameter graphunit distance graph

Mathematics Subject Classification ID

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

Related Items (4)

On almost-equidistant sets. II ⋮ Nearly \(k\)-distance sets ⋮ On the partition of plane sets into 6 subsets of small diameter ⋮ Counterexamples to Borsuk's conjecture with large girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Schur's conjecture in \(\mathbb{R}^{4}\)
• A constructive proof of Kirszbraun's theorem
• Diameter graphs in \({\mathbb R}^4\)
• Dispersed points and geometric embedding of complete bipartite graphs
• Remarks on Schur's conjecture
• Unit distances and diameters in Euclidean spaces
• Some properties of graphs of diameters
• Large simplices determined by finite point sets
• On Schur's conjecture in \(\mathbb R^4\)
• On simplices in diameter graphs in \(\mathbb{R}^4\)
• Around Borsuk's hypothesis
• Research Problems in Discrete Geometry

This page was built for publication: Proof of Schur's conjecture in \(\mathbb R^D\)