1 problem

Let $(H_n)_{n\in\mathbb{N}_{\geq 1}}$ be a family of trees, and let $K_n$ denote the complete graph on $n$ vertices. Write $\operatorname{MT}(H_n,K_n)$ for the minimum number of st…