There are at most $2^{d+1}-2$ neighbourly simplices in dimension $d$

Abstract

A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most $2^{d+1}-2$ neighbourly simplices in $\mathbb R^d$, is presented.