On vertex covers, matchings and random trees

Details On vertex covers, matchings and random trees On vertex covers, matchings and random trees

2004-07-27

arxiv.org/abs/math/0407456v1

Mathematics

Combinatorics

Scientific paper

We study minimal vertex covers and maximal matchings on trees. We pay special attention to the corresponding backbones i.e. these vertices that are occupied and those that are empty in every minimal vertex cover (resp. these egdes that are occupied and those that are empty in every maximal matching). The key result in our approach is that for trees, the backbones can be recovered from a particular tri-coloring which has a simple characterization. We give applications to the computation of some averages related to the enumeration of minimal vertex covers and maximal matchings in the random labeled tree ensemble, both for finite size and in the asymptotic regime.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-262006