Transversals in trees

Details Transversals in trees Transversals in trees

2007-05-13

arxiv.org/abs/0705.1806v1

Mathematics

Combinatorics

Scientific paper

A transversal in a rooted tree is any set of nodes that meets every path from the root to a leaf. We let c(T,k) denote the number of transversals of size k in a rooted tree T. We define a partial order on the set of all rooted trees with n nodes by saying that a tree T succeeds a tree T' if c(T,k) is at least c(T',k) for all k and strictly greater than c(T',k) for at least one k. We prove that, for every choice of positive integers d and n, the set of all rooted trees on n nodes where each node has at most d children has a unique minimal element with respect to this partial order and we describe this tree.

Affiliated with

Also associated with

No associations

Rating

Transversals in trees 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 Transversals in trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transversals in trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-457903