Intersection representation of digraphs in trees with few leaves
  The leafage of a digraph is the minimum number of leaves in a host tree in which it has a subtree intersection representation. We discuss bounds on the leafage in terms of other parameters (including Ferrers dimension), obtaining a string of sharp inequalities. 
In-Jen Lin (National Ocean University - Taipei), Malay K. Sen (North   Bengal University - Darjeeling), Douglas B. West (Uni...