English

Polynomial expansion and sublinear separators

Combinatorics 2017-10-31 v2

Abstract

Let C\mathcal{C} be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed 0<δ10<\delta\le 1, every nn-vertex graph of C\mathcal{C} has a balanced separator of order O(n1δ)O(n^{1-\delta}), then any depth-kk minor (i.e. minor obtained by contracting disjoint subgraphs of radius at most kk) of a graph in C\mathcal{C} has average degree O((k polylog k)1/δ)O\big((k \text{ polylog }k)^{1/\delta}\big). This confirms a conjecture of Dvo\v{r}\'ak and Norin.

Keywords

Cite

@article{arxiv.1705.01438,
  title  = {Polynomial expansion and sublinear separators},
  author = {Louis Esperet and Jean-Florent Raymond},
  journal= {arXiv preprint arXiv:1705.01438},
  year   = {2017}
}

Comments

6 pages, no figure

R2 v1 2026-06-22T19:35:40.544Z