Polynomial expansion and sublinear separators
Abstract
Let C be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed 0<δ 1, every n-vertex graph of C has a balanced separator of order O(n1-δ), then any depth-k minor (i.e. minor obtained by contracting disjoint subgraphs of radius at most k) of a graph in C has average degree O((k polylog k)1/δ). This confirms a conjecture of Dvor\'ak and Norin.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.