1 problem

Let $T$ and $T'$ be unlabelled trees, considered up to isomorphism, with $n$ vertices. For a tree $T$, let $\mathcal{B}(T)$ denote its graph building set and let…