# Graph containing every trees of size $n$ as subgraphs

What is the minimum number of edges of graph $G$, so that every tree of size $n$ is a subgraph of $G$?

I personally managed to find a lower bound of $c n \log n$ and an upper bound of $C n \log ^2 n$. But what I'm actually trying to ask is not the problem itself, but reference for it. I strongly believe that this problem would had been considered by some mathematicians, but searching gives articles about minimum spanning tree. Where can I find some results for this problem?

-

Such kind of graphs are called universal graphs, and Chung and Graham proved that there exists such a graph with $O(n \log n)$ edges.