Erdosa and Sós conjectured in 1963 that if G is a graph o ofof ordeq >1/2p(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 ...Erdosa and Sós conjectured in 1963 that if G is a graph o ofof ordeq >1/2p(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.展开更多
文摘Erdosa and Sós conjectured in 1963 that if G is a graph o ofof ordeq >1/2p(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.
基金National Natural Science Foundation of China(11071002)Program for New Century Excellent Talents in University,Key Project of Chinese Ministry of Education(210091)+3 种基金Specialized Research Fund for the Doctoral Program of Higher Education(20103401110002)Anhui Provincial Natural Science Foundation(10040606Y33)Project of Educational Department of Anhui Province(KJ2010B136)Scientific Research Fund for Fostering Distinguished Young Scholars of Anhui University,Project for Academic Innovation Team of Anhui University(KJTD001B)
