Acta mathematica scientia,Series A ›› 1997, Vol. 17 ›› Issue (S1): 125-131.
Previous Articles Next Articles
Wang Min1, Zhao Yanqing1, Li Guojun2
Received:
Online:
Published:
Abstract: Erdös and Sós conjectured in 1963 that if G is a graph of order q and size q with q>(1/2)p(k-1), then G contains every tree of size k. It is shown in this paper that the conjecture is true if the complement G of G contains no a copy of K3 as an induced subgraph of G.
Key words: packing, isomorphic graphs.Erdös-Sós Conjecture
Wang Min, Zhao Yanqing, Li Guojun. A NEW RESULT ON ERDÖS-SÓS CONJECTURE[J].Acta mathematica scientia,Series A, 1997, 17(S1): 125-131.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://121.43.60.238/sxwlxbA/EN/
http://121.43.60.238/sxwlxbA/EN/Y1997/V17/IS1/125
Cited