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

TL;DR

This paper establishes improved bounds on the $r$-profile complexity of various structured graph classes, including minor-free and treewidth-bounded graphs, with implications for their structural properties and algorithms.

Contribution

It provides new tight bounds on $r$-profile complexity for minor-excluding and treewidth-bounded graphs, answering open questions and extending to other classes like bounded expansion and interval graphs.

Findings

Bound $r$-profile complexity for $K_h$-minor-free graphs as $O_h(r^{3h-3}k)$.

Bound $r$-profile complexity for graphs with treewidth at most $t$ as $O_t(r^{t+1}k)$, tight up to a factor.

Improved bounds for graphs of treelength and special classes like chordal and interval graphs.

Abstract

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 subsets of $A$ realized as the intersection between the $r$-neighbourhood of some vertex and $A$. A~refinement of this notion is the \emph{$r$-profile complexity}, that counts the maximum number of distinct distance-vectors from any vertex to the vertices of $A$, ignoring distances larger than~$r$. Typically, in structured graph classes such as graphs of bounded VC-dimension or chordal graphs, these functions are bounded, leading to insights into their structural properties and efficient algorithms. We improve existing bounds on the $r$-profile complexity (and thus on the $r$-neighbourhood complexity) for graphs in several structured graph classes. We show that the $r$-profile complexity of graphs excluding $K_h$ as a minor is in $O_h(r^{3h-3}k)$. For graphs of treewidth at most~$t$, we give a bound in $O_t(r^{t+1}k)$, which is tight up to a function of~$t$ as a factor. These bounds improve results of Joret and Rambaud and answer a question of their paper [Combinatorica, 2024]. We also apply our methods to other classes of bounded expansion such as graphs excluding a fixed complete graph as a subdivision. For outerplanar graphs, we can improve our treewidth bound by a factor of $r$ and conjecture that a similar improvement holds for graphs with bounded simple treewidth. For graphs of treelength at most~$\ell$, we give the upper bound of $O(k(r^2(\ell+1)^k))$, which we improve to $O\left (k\cdot (r 2^k + r^2k^2) \right)$ in the case of chordal graphs and $O(k^2r)$ for interval graphs. Our bounds also imply relations between the order, diameter and metric dimension of graphs in these classes, improving results from [Beaudou et al., SIDMA 2017].