On the number of matchings of a tree (Q875067): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2006.01.014 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009228151 / rank | |||
Revision as of 20:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of matchings of a tree |
scientific article |
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
