Subtrees and Subforests of Graphs

In this paper we present sufficient edge-number and degree conditions for a graph to contain all forests of given size. The edge-number bound answers in the affirmative a conjecture due to Erdős and Sós. Furthermore, we will give improved bounds for specified spanning subtrees of graphs.