Degree Conditions for Trees in Undirected and Directed Graphs
摘要
We survey some recent results on bounds on the minimum and maximum degree of graph that ensure it contains all trees of a fixed size, and corresponding results for digraphs. We also present a number of conjectures and open questions.