On the number of matchings of a tree (Q875067): Difference between revisions

The author obtains explicit expressions for the average number of \(k\)-matchings and the average number of maximal matchings of size \(k\) in rooted ordered trees, labelled trees, and \(s\)-ary trees with \(n\) vertices; and he derives asymptotic expressions for the average total number of maximum matchings in rooted ordered trees, labelled trees, and binary trees with \(n\) vertices. He also gives various results on the asymptotic distribution of these and related parameters for these families of trees. Some of the results are extensions of results given by \textit{M. Klazar} [Eur. J. Comb. 18, 195--210 (1997; Zbl 0868.05017)].