Acta mathematica scientia,Series A ›› 1997, Vol. 17 ›› Issue (S1): 125-131.

Previous Articles     Next Articles

A NEW RESULT ON ERDÖS-SÓS CONJECTURE

Wang Min1, Zhao Yanqing1, Li Guojun2   

  1. 1. Department of Mathematics, Yantai University, Yantai, 264005, P. R. China;
    2. Institute of Mathematics and Systems Science Shandong University, Jinan 250100, P. R. China
  • Received:1995-10-30 Online:1997-12-26 Published:1997-12-26

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

Trendmd