Intersection representation of digraphs in trees with few leaves

From MaRDI portal



Abstract: 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.












This page was built for publication: Intersection representation of digraphs in trees with few leaves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4719324)