Intersection representation of digraphs in trees with few leaves

Details Intersection representation of digraphs in trees with few leaves Intersection representation of digraphs in trees with few leaves

1998-07-29

arxiv.org/abs/math/9807165v1

Mathematics

Combinatorics

12 pages, 3 included figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Intersection representation of digraphs in trees with few leaves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Intersection representation of digraphs in trees with few leaves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intersection representation of digraphs in trees with few leaves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462140