1 problem

Let $k,n\in\mathbb{N}\setminus\{1\}$. A $k$-tree is defined recursively: a single edge is a $k$-tree, and a $k$-tree with $\ell$ edges is obtained from one with $\ell-1$ edges by a…