Oriented trees in digraphs with large girth

Junying Lu, Yaojun Chen

The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell +1$ and minimum degree at least $k/\ell…