Neighborhood complexity and kernelization for nowhere dense classes of graphs

Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer +4

We prove that whenever $G$ is a graph from a nowhere dense graph class $\mathcal{C}$, and $A$ is a subset of vertices of $G$, then the number of subsets of $A$ that are realized as…