Trees with at least $6\mathrm{\ell }+11$ vertices are $\mathrm{\ell }$-reconstructible

The $(n-\mathrm{\ell })$-deck of an $n$-vertex graph is the multiset of (unlabeled) subgraphs obtained from it by deleting $\mathrm{\ell }$ vertices. An $n$-vertex graph is $\mathrm{\ell }$-reconstructible if it is determined by its $(n-\mathrm{\ell })$-deck, meaning that no other graph has the same deck. We prove that every tree with at least $6\mathrm{\ell }+11$ vertices is $\mathrm{\ell }$-reconstructible.