We show a general result known as the Erdos_Sos Conjecture: if
$E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of
order $k+1$ as a subgraph.Comment: This paper has been withdrawn by the author. This paper was presented
  at Discrete Math Days in Fort Collins Colorad

Gilbert, Jesse

arXiv.org e-Print Archive

An extension of a result concerning convex geometric graphs

The Erdős-Sos conjecture states that if G has |E(G) |&gt; 