Intersection representation of digraphs in trees with few leaves
Combinatorics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/9807165,
title = {Intersection representation of digraphs in trees with few leaves},
author = {In-Jen Lin and Malay K. Sen and Douglas B. West},
journal= {arXiv preprint arXiv:math/9807165},
year = {2007}
}
Comments
12 pages, 3 included figures