English

Separators for intersection graphs of spheres

Computational Geometry 2026-03-24 v1 Combinatorics

Abstract

We prove the existence of optimal separators for intersection graphs of balls and spheres in any dimension dd. One of our results is that if an intersection graph of nn spheres in Rd\mathbb{R}^d has mm edges, then it contains a balanced separator of size Od(m1/dn12/d)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.

Keywords

Cite

@article{arxiv.2603.22204,
  title  = {Separators for intersection graphs of spheres},
  author = {Jacob Fox and Jonathan Tidor},
  journal= {arXiv preprint arXiv:2603.22204},
  year   = {2026}
}

Comments

14 pages, 5 figures; to appear in SoCG 2026

R2 v1 2026-07-01T11:33:41.673Z