arXiv · 2501.09142
Universal geometric non-embedding of random regular graphs
Abstract
Let $\Delta \ge 3$ be fixed, $n \ge n_\Delta$ be a large integer. It is a classical result that $\Delta$--regular expanders on $n$ vertices are not embeddable as geometric (distance) graphs into Euclidean space of dimension less than $c \log n$, for some universal constant $c$. We show that for typical $\Delta$-regular graphs, this obstruction is universal with respect to the choice of norm. More precisely, for a uniform random $\Delta$-regular graph $G$ on $n$ vertices, it holds with high probability: there is no normed space of dimension less than $c\log n$ which admits a geometric graph isomorphic to $G$. The proof is based on a seeded multiscale $\varepsilon$--net argument.
Explore related subjects
Keep this discovery
Dylan J. Altschuler, Konstantin Tikhomirov. 2025-01-15. Universal geometric non-embedding of random regular graphs. https://arxiv.org/abs/2501.09142
Cite the original work for its findings. Save a collection to share your selection of sources.