2 problems

Linear neighborhood-complexity conjecture. Every hereditary small class of graphs has neighborhood complexity $O(n)$.

The neighborhood-complexity characterization. The class $\mathcal{C}$ is nowhere dense if and only if there exists a function $f_{\mathrm{nei}}(r,\varepsilon)$ such that