An extension of a result concerning convex geometric graphs

We show a general result known as the Erdos_Sos Conjecture: if $E(G)>1\mathrm{/}2(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of order $k+1$ as a subgraph.