🤖 AI Summary
This work investigates the construction of balanced separators in intersection graphs of balls (or spheres) in high-dimensional Euclidean space. By integrating tools from combinatorial geometry and graph partitioning theory, it establishes—for the first time—the existence of a balanced separator of size \(O_d(m^{1/d} n^{1-2/d})\) in any intersection graph with \(n\) balls in \(\mathbb{R}^d\) and \(m\) edges, for arbitrary dimension \(d\). This bound is tight up to constant factors depending only on \(d\), resolving a long-standing open question regarding separator sizes in high-dimensional ball intersection graphs. Moreover, the result extends to fat convex objects and their boundary variants, substantially broadening the scope of existing separator theorems.
📝 Abstract
We prove the existence of optimal separators for intersection graphs of balls and spheres in any dimension $d$. One of our results is that if an intersection graph of $n$ spheres in $\mathbb{R}^d$ has $m$ edges, then it contains a balanced separator of size $O_d(m^{1/d}n^{1-2/d})$. This bound is best possible in terms of the parameters involved. The same result holds if the balls and spheres are replaced by fat convex bodies and their boundaries.