Oriented trees and paths in digraphs

Which conditions ensure that a digraph contains all oriented paths of some given length, or even a all oriented trees of some given size, as a subgraph? One possible condition could be that the host digraph is a tournament of a certain order. In arbitrary digraphs and oriented graphs, conditions on the chromatic number, on the edge density, on the minimum outdegree and on the minimum semidegree have been proposed. In this survey, we review the known results, and highlight some open questions in the area