Overlap properties of geometric expanders

Jacob Fox, Mikhail Gromov, Vincent Lafforgue +2

The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d…