The number of F-matchings in almost every tree is a zero residue

Details The number of F-matchings in almost every tree is a zero residue The number of F-matchings in almost every tree is a zero residue

2010-06-28

arxiv.org/abs/1006.5427v1

Mathematics

Combinatorics

7 pages. Submitted to Electronic Journal of Combinatorics

Scientific paper

For graphs F and G an F-matching in G is a subgraph of G consisting of pairwise vertex disjoint copies of F. The number of F-matchings in G is denoted by s(F,G). We show that for every fixed positive integer m and every fixed tree F, the probability that s(F,T_n) = 0 mod m, where T_n is a random labeled tree with n vertices, tends to one exponentially fast as n grows to infinity. A similar result is proven for induced F-matchings. This generalizes a recent result of Wagner who showed that the number of independent sets in a random labeled tree is almost surely a zero residue.

Affiliated with

Also associated with

No associations

Rating

The number of F-matchings in almost every tree is a zero residue 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 The number of F-matchings in almost every tree is a zero residue, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of F-matchings in almost every tree is a zero residue will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-617564