Induced subdivisions and bounded expansion
Combinatorics
2017-06-20 v1
Abstract
We prove that for every graph H and for every integer s, the class of graphs that do not contain K_s, K_{s,s}, or any subdivision of H as an induced subgraph has bounded expansion; this strengthens a result of Kuhn and Osthus. The argument also gives another characterization of graph classes with bounded expansion and of nowhere-dense graph classes.
Keywords
Cite
@article{arxiv.1706.05766,
title = {Induced subdivisions and bounded expansion},
author = {Zdeněk Dvořák},
journal= {arXiv preprint arXiv:1706.05766},
year = {2017}
}
Comments
8 pages, no figures