On nowhere dense graphs

@article{Nesetril2011OnND,
  title={On nowhere dense graphs},
  author={Jaroslav Nesetril and Patrice Ossona de Mendez},
  journal={Eur. J. Comb.},
  year={2011},
  volume={32},
  pages={600-617}
}
A set A of vertices of a graph G is called d-scattered in G if no two dneighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct vertices of A have distance at most 2d. This notion was isolated in the context of finite model theory by Gurevich and recently it played a prominent role in the study of homomorphism preservation theorems for special classes of structures (such as minor closed families). This in turn led to the notions of wide, semiwide… CONTINUE READING
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS