No more than $2^{d+1}-2$ nearly neighbourly simplices in $\mathbb R^d$
Andrzej P. Kisielewicz, Krzysztof Przesławski·2019-12-31·via math.CO updates on arXiv.org
We prove a combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there are at most $2^{d+1}-2$ nearly neighbourly simplices in $\mathbb R^d$.
