Oriented Forests in Directed Graphs

Abstract If H is any oriented forest with m edges, then any directed graph of order ⩾ | H | with minimum out-degree as well as minimum in-degree ⩾m contains H.

[1]  Irmina A. Ziolo.  Subtrees of Bipartite Digraphs - The Minimum Degree Condition , 2000, Discret. Appl. Math..

[2]  Stephan Brandt,et al.  Subtrees and Subforests of Graphs , 1994, J. Comb. Theory, Ser. B.