数学物理学报 ›› 1997, Vol. 17 ›› Issue (S1): 125-131.
王敏1, 赵艳青1, 李国君2
Wang Min1, Zhao Yanqing1, Li Guojun2
摘要: 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.