Sublinear separators, fragility and subexponential expansion
Zdenek Dvorak

TL;DR
This paper establishes that certain graph classes with small balanced separators exhibit subexponential expansion, linking separator size to graph expansion properties.
Contribution
It proves a partial converse relating small separators to subexponential expansion in bounded degree, subgraph-closed graph classes, introducing new graph decomposition techniques.
Findings
Graphs with polynomially smaller balanced separators have subexponential expansion.
Introduces new graph decomposition methods for analyzing graph structure.
Provides a partial converse to a known result by Nesetril and Ossona de Mendez.
Abstract
Let G be a subgraph-closed graph class with bounded maximum degree. We show that if G has balanced separators whose size is smaller than linear by a polynomial factor, then G has subexponential expansion. This gives a partial converse to a result of Ne\v{s}et\v{r}il and Ossona de Mendez. As an intermediate step, the proof uses a new kind of graph decompositions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Markov Chains and Monte Carlo Methods
