English

Non-existence of annular separators in geometric graphs

Combinatorics 2021-07-22 v1 Data Structures and Algorithms Metric Geometry

Abstract

Benjamini and Papasoglou (2011) showed that planar graphs with uniform polynomial volume growth admit 11-dimensional annular separators: The vertices at graph distance RR from any vertex can be separated from those at distance 2R2R by removing at most O(R)O(R) vertices. They asked whether geometric dd-dimensional graphs with uniform polynomial volume growth similarly admit (d1)(d-1)-dimensional annular separators when d>2d > 2. We show that this fails in a strong sense: For any d3d \geq 3 and every s1s \geq 1, there is a collection of interior-disjoint spheres in Rd\mathbb{R}^d whose tangency graph GG has uniform polynomial growth, but such that all annular separators in GG have cardinality at least RsR^s.

Keywords

Cite

@article{arxiv.2107.09790,
  title  = {Non-existence of annular separators in geometric graphs},
  author = {Farzam Ebrahimnejad and James R. Lee},
  journal= {arXiv preprint arXiv:2107.09790},
  year   = {2021}
}

Comments

17 pages, 7 figures