Nowhere dense graph classes, stability, and the independence property
Logic
2010-11-18 v1 Discrete Mathematics
Logic in Computer Science
Abstract
A class of graphs is nowhere dense if for every integer r there is a finite upper bound on the size of cliques that occur as (topological) r-minors. We observe that this tameness notion from algorithmic graph theory is essentially the earlier stability theoretic notion of superflatness. For subgraph-closed classes of graphs we prove equivalence to stability and to not having the independence property.
Keywords
Cite
@article{arxiv.1011.4016,
title = {Nowhere dense graph classes, stability, and the independence property},
author = {Hans Adler and Isolde Adler},
journal= {arXiv preprint arXiv:1011.4016},
year = {2010}
}
Comments
9 pages