On The Erd(o|¨)s-Sos Conjecture

Erdos and Sos in1963proposed the following famous conjecture that a graph G with average degree d(G)> k-2contains every tree T with k vertices. This thesis first surveys some important results and methods on the conjecture. With these existing results and developed methods the conjecture is proved to be true for k=9.