| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654517 | European Journal of Combinatorics | 2007 | 9 Pages |
Abstract
In a paper by Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to obtain exact formulas for some of the countings by means of the Lagrange inversion formula. In this note, the results of Klazar are extended to formulas for matchings, maximal matchings and maximum matchings for three types of simply generated trees. Finally, edge coverings are considered and the results are compared.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Stephan G. Wagner,