Title of article
Subtrees and Subforests of Graphs
Author/Authors
Brandt، نويسنده , , S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
8
From page
63
To page
70
Abstract
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.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1994
Journal title
Journal of Combinatorial Theory Series B
Record number
1525870
Link To Document