No more than 2^d+1-2 nearly neighbourly simplices in \mathbb R^d

2019/12/31 by Kisielewicz, Andrzej P., Przesławski, Krzysztof
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1912.13176

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.

Related

• There are at most 2^d+1-2 neighbourly simplices in dimension d
• On the number of neighborly simplices in R^d
• New bounds on the maximum number of neighborly boxes in R^d
• Nearly neighbourly families of standard boxes
• Neighborly boxes and bipartite coverings; constructions and conjectures