Abstract

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$$ .

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call