Proof of Schur's conjecture in \(\mathbb R^D\)
A diameter graph in Euclidean \(d\)-space \(\mathbb{R}^d\) is a finite graph whose vertex set has diameter 1 and whose edges are formed by the pairs of vertices at distance 1. The authors prove that every diameter graph on \(n\) vertices in \(\mathbb{R}^d\) can have at most \(n\) cliques of size \(d\). This proves a conjecture by Zvi Schur. The paper also establishes an analogous result for diameter graphs of unit edge length on a \(d\)-sphere of radius \(1/\sqrt{2}\).
scientific article; zbMATH DE number 6909483