Sublinear separators in intersection graphs of convex shapes
Combinatorics
2020-01-07 v1
Abstract
We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection graphs. Furthermore, the argument used to prove the existence of sublinear separators is based on a connection with generalized coloring numbers which has not been previously explored in geometric settings.
Cite
@article{arxiv.2001.01552,
title = {Sublinear separators in intersection graphs of convex shapes},
author = {Zdenek Dvorak and Rose McCarty and Sergey Norin},
journal= {arXiv preprint arXiv:2001.01552},
year = {2020}
}
Comments
23 pages, 5 figures