On simplices in diameter graphs in \(\mathbb{R}^4\)

DOI10.1134/S000143461701031XzbMath1364.05026OpenAlexW2594723852MaRDI QIDQ2396420

Andrey B. Kupavskii, Aleksandr A. Polyanskii

Publication date: 8 June 2017

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s000143461701031x

zbMATH Keywords

diameter graphsSchur conjecture

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (4)

On almost-equidistant sets. II ⋮ Remarks on Schur's conjecture ⋮ On the partition of plane sets into 6 subsets of small diameter ⋮ Proof of Schur's conjecture in \(\mathbb R^D\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Schur's conjecture in \(\mathbb{R}^{4}\)
• A 64-dimensional counterexample to Borsuk's conjecture
• Diameter graphs in \({\mathbb R}^4\)
• Unit distances and diameters in Euclidean spaces
• On Borsuk's conjecture for two-distance sets
• On Schur's conjecture in \(\mathbb R^4\)
• Borsuk's problem and the chromatic numbers of some metric spaces
• Coloring Distance Graphs and Graphs of Diameters
• Remarks on Schur’s Conjecture
• A counterexample to Borsuk’s conjecture
• Research Problems in Discrete Geometry

This page was built for publication: On simplices in diameter graphs in \(\mathbb{R}^4\)