Polynomial expansion and sublinear separators
From MaRDI portal
Abstract: Let be a class of graphs that is closed under taking subgraphs. We prove that if for some fixed , every -vertex graph of has a balanced separator of order , then any depth- minor (i.e. minor obtained by contracting disjoint subgraphs of radius at most ) of a graph in has average degree . This confirms a conjecture of Dvov{r}'ak and Norin.
Recommendations
Cites work
- scientific article; zbMATH DE number 1003278 (Why is no real title available?)
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Degree-3 treewidth sparsifiers
- Large-treewidth graph decompositions and applications
- Small complete minors above the extremal edge density
- Sparsity. Graphs, structures, and algorithms
- Strongly sublinear separators and polynomial expansion
Cited in
(13)- On subwords in the base-$q$ expansion of polynomial and exponential functions
- scientific article; zbMATH DE number 5263329 (Why is no real title available?)
- Sublinear separators in intersection graphs of convex shapes
- Notes on graph product structure theory
- On subword decomposition and balanced polynomials
- Sublinear separators, fragility and subexponential expansion
- Improved bounds for weak coloring numbers
- A note on sublinear separators and expansion
- Sparse graphs without long induced paths
- Coloring and covering nowhere dense graphs
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Strongly sublinear separators and polynomial expansion
- On weighted sublinear separators
This page was built for publication: Polynomial expansion and sublinear separators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686248)