Subforests of bipartite digraphs — the minimum degree condition Original Research Article

Let D be a bipartite digraph and let F be an oriented forest of size k−1. We consider two conditions on the minimum indegree and the minimum outdegree of the digraph D guaranteeing that D contains F. These conditions extend older results concerning oriented trees of size k−1.