2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/77224The 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.12 pages, 3 included figuresCombinatorics05C35, 05C50, 05C75text