  The Erd\"os-S\'os conjecture states that if $G$ is a graph with average
degree more than $k-1$, then G contains every tree of $k$ edges. A spider is a
tree with at most one vertex of degree more than 2. In this paper, we prove
that Erd\"os-S\'os conjecture holds for all spiders.
