On covering intersecting set-systems by digraphs

We establish a common generalization of a theorem of Edmonds on the number of disjoint branchings and a theorem of Frank on kernel systems.