The Erdős-Sós conjecture for graphs of girth 5
暂无分享,去创建一个
Abstract We prove that every graph of girth at least 5 with minimum degree δ ⩾ k /2 contains every tree with k edges, whose maximum degree does not exceed the maximum degree of the graph. An immediate consequence is that the famous Erdős-Sos Conjecture, saying that every graph of order n with more than n ( k − 1)/2 edges contains every tree with k edges, is true for graphs of girth at least 5.
[1] Claude Berge,et al. The theory of graphs and its applications , 1962 .
[2] Christopher M. Hartman. Extremal problems in graph theory , 1997 .
[3] Bela Bollobas,et al. Graph theory , 1979 .
[4] Stephan Brandt,et al. Subtrees and Subforests of Graphs , 1994, J. Comb. Theory, Ser. B.