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+1 and minimum degree at least k/ contains every tree T with k edges whose maximum degree does not exceed the minimum degree of G. Let δ⁰ (D) be the minimum semidegree of a digraph D and Δ (D) be the maximum degree of D. In this paper, we establish a digraph version of Jiang's result, stating that every oriented graph D of girth at least 2+1 with δ⁰ (D) \k/, Δ (T) \ contains every oriented tree with k edges, that answers a question raised by Stein and Trujillo-Negrete in affirmative.
Lu et al. (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: