Premium
Intersection representation of digraphs in trees with few leaves
Author(s) -
Lin InJen,
Sen Malay K.,
West Douglas B.
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199912)32:4<340::aid-jgt3>3.0.co;2-r
Subject(s) - digraph , combinatorics , mathematics , intersection (aeronautics) , tree (set theory) , representation (politics) , dimension (graph theory) , graph , string (physics) , discrete mathematics , politics , political science , law , engineering , mathematical physics , aerospace engineering
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. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 340–353, 1999