# Neighborhood complexity of planar graphs

## TL;DR

This paper proves that in planar graphs, the number of distinct intersections between a vertex subset and balls of radius r grows polynomially with r, confirming a conjecture and extending to minor-closed classes.

## Contribution

It establishes a polynomial bound on neighborhood complexity in planar graphs, confirming Soko{
}owski's conjecture and generalizing to minor-closed classes.

## Key findings

- Polynomial bound of O(r^4 |A|) for planar graphs
- Extension of polynomial bounds to minor-closed classes
- Resolution of a conjecture on neighborhood complexity

## Abstract

Reidl, S\'anchez Villaamil, and Stravopoulos (2019) characterized graph classes of bounded expansion as follows: A class $\mathcal{C}$ closed under subgraphs has bounded expansion if and only if there exists a function $f:\mathbb{N} \to \mathbb{N}$ such that for every graph $G \in \mathcal{C}$, every nonempty subset $A$ of vertices in $G$ and every nonnegative integer $r$, the number of distinct intersections between $A$ and a ball of radius $r$ in $G$ is at most $f(r) |A|$. When $\mathcal{C}$ has bounded expansion, the function $f(r)$ coming from existing proofs is typically exponential. In the special case of planar graphs, it was conjectured by Soko{\l}owski (2021) that $f(r)$ could be taken to be a polynomial. In this paper, we prove this conjecture: For every nonempty subset $A$ of vertices in a planar graph $G$ and every nonnegative integer $r$, the number of distinct intersections between $A$ and a ball of radius $r$ in $G$ is $O(r^4 |A|)$. We also show that a polynomial bound holds more generally for every proper minor-closed class of graphs.