On weighted sublinear separators
Combinatorics
2021-09-20 v3
Abstract
Consider a graph G with an assignment of costs to vertices. Even if G and all its subgraphs admit balanced separators of sublinear size, G may only admit a balanced separator of sublinear cost after deleting a small set Z of exceptional vertices. We improve the bound on |Z| from O(log |V(G)|) to O(log log...log |V(G)|), for any fixed number of iterations of the logarithm.
Keywords
Cite
@article{arxiv.2007.11853,
title = {On weighted sublinear separators},
author = {Zdeněk Dvořák},
journal= {arXiv preprint arXiv:2007.11853},
year = {2021}
}
Comments
14 pages, 0 figures. (v2) Correction to the statement and proof of Theorem 6 (v3) minor changes from reviews after reviews