科研之友
微信
新浪微博
Facebook
分享链接
摘要
Erdos and SA(3)s conjectured in 1963 that every graph G on n vertices with edge number e(G) > A1/2 (k - 1)n contains every tree T with k edges as a subgraph. In this paper, we consider a variation of the above conjecture, that is, for n a parts per thousand yen 9/2 k (2) + 37/2 k+14 and every graph G on n vertices with e(G) > A1/2 (k - 1)n, we prove that there exists a graph G' on n vertices having the same degree sequence as G and containing every tree T with k edges as a subgraph.
