ELMO SL 2011 C7

Let $T$ be a tree. Prove that there is a constant $c>0$ (independent of $n$ ) such that every graph with $n$ vertices that does not contain a subgraph isomorphic to $T$ has at most $cn$ edges.

David Yang.