Intersection representation of digraphs in trees with few leaves
In-Jen Lin, Malay Kr. Sen, Douglas B. West · arXiv (Cornell University) · 1998
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.