No more than $2^{d+1}-2$ nearly neighbourly simplices in $\mathbb R^d$
Combinatorics
2020-01-01 v1
Abstract
We prove a combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there are at most nearly neighbourly simplices in .
Cite
@article{arxiv.1912.13176,
title = {No more than $2^{d+1}-2$ nearly neighbourly simplices in $\mathbb R^d$},
author = {Andrzej P. Kisielewicz and Krzysztof Przesławski},
journal= {arXiv preprint arXiv:1912.13176},
year = {2020}
}
Comments
6 pages, accepted to Discrete Comput. Geom