论文部分内容阅读
It is well known that any graph with minimum degree at least k must contain all trees of order k + 1.In this topic, we will discuss some extremal problems and results concerning the existence of all trees in a graph, and the relations among these problems.