Bounding mean orders of sub-$k$-trees of $k$-trees

Stijn Cambie, Bradley McCoy, Stephan Wagner +1

For a $k$-tree $T$, we prove that the maximum local mean order is attained in a $k$-clique of degree $1$ and that it is not more than twice the global mean order. We also bound the…