Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs

Laurent Beaudou, Jan Bok, Florent Foucaud +2

The \emph{$r$-neighbourhood complexity} of a graph $G$ is the function counting, for a given integer $k$, the largest possible number, over all vertex-subsets $A$ of size $k$, of s…