论文信息 - The Erdõs-Sós Conjecture for trees of diameter four

The Erdõs-Sós Conjecture for trees of diameter four

The Erdos-Sos Conjecture is that a finite graph G with average degree greater than k - 2 contains every tree with k vertices. Theorem 1 is a special case: every k-vertex tree of diameter four can be embedded in G. A more technical result, Theorem 2, is obtained by extending the main ideas in the proof of Theorem 1. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 291301, 2005

Andrew McLennan | A. McLennan

[1] Mariusz Wozniak,et al. The Erdös-Sós Conjecture for Graphs withoutC4 , 1997, J. Comb. Theory, Ser. B.

[2] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .

[3] Ronald L. Graham,et al. Erdős on Graphs , 2020 .

[4] Mariusz Wo niak. On the Erds-Ss conjecture , 1996 .

[5] A. F. Sidorenko,et al. Asymptotic solution for a new class of forbiddenr-graphs , 1989, Comb..

[6] János Pach,et al. Recent Developments in Combinatorial Geometry , 1993 .

[7] Mariusz Woźniak. On the Erdos-Sós conjecture , 1996 .

[8] Edward Dobson,et al. The Erdős-Sós conjecture for graphs of girth 5 , 1996, Discret. Math..

[9] Bing Zhou,et al. A NOTE ON THE ERDÖS-SÖS CONJECTURE , 1984 .