There are at most $2^{d+1}-2$ neighbourly simplices in dimension $d$
Combinatorics
2019-02-18 v1
Abstract
A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most neighbourly simplices in , is presented.
Cite
@article{arxiv.1902.05597,
title = {There are at most $2^{d+1}-2$ neighbourly simplices in dimension $d$},
author = {Andrzej P. Kisielewicz and Krzysztof Przesławski},
journal= {arXiv preprint arXiv:1902.05597},
year = {2019}
}
Comments
7 pages