Given $n$, what is the smallest number $N=N(n)$ with the property that there exists a tree on $N$ (unlabelled) vertices that contains a copy of every tree on $n$ vertices?
That such $N$ must exist is easy to see in a number of ways.
Given $n$, what is the smallest number $N=N(n)$ with the property that there exists a tree on $N$ (unlabelled) vertices that contains a copy of every tree on $n$ vertices?
That such $N$ must exist is easy to see in a number of ways.
Copyright © 2021 JogjaFile Inc.