On the number of matchings of a tree (Q875067)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 5141677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of matchings of a tree |
scientific article; zbMATH DE number 5141677 |
Statements
On the number of matchings of a tree (English)
0 references
10 April 2007
0 references
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)].
0 references
enumeration
0 references
matchings
0 references
trees
0 references
0 references
0.8537454605102539
0 references
0.8408213257789612
0 references
0.8166041970252991
0 references
0.795857310295105
0 references
