Non-existence of annular separators in geometric graphs

07/20/2021
by   Farzam Ebrahimnejad, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/22/2021

On the Connectivity and the Diameter of Betweenness-Uniform Graphs

Betweenness centrality is a centrality measure based on the overall amou...
research
02/25/2020

The firefighter problem on polynomial and intermediate growth groups

We prove that any Cayley graph G with degree d polynomial growth does no...
research
12/03/2019

Jones' Conjecture in subcubic graphs

We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic ...
research
07/19/2018

Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs

We consider two optimization problems in planar graphs. In Maximum Weigh...
research
12/19/2019

On existence of perfect bitrades in Hamming graphs

A pair (T_0,T_1) of disjoint sets of vertices of a graph G is called a p...
research
08/10/2023

Counting geodesics between surface triangulations

Given a surface Σ equipped with a set P of marked points, we consider th...
research
05/08/2021

Multi-layered planar firefighting

Consider a model of fire spreading through a graph; initially some verti...

Please sign up or login with your details

Forgot password? Click here to reset