On the number of matchings of a tree

DOI10.1016/j.ejc.2006.01.014zbMath1119.05024OpenAlexW2009228151MaRDI QIDQ875067

Stephan G. Wagner

Publication date: 10 April 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2006.01.014

zbMATH Keywords

enumerationtreesmatchings

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

Unnamed Item ⋮ Extremal graphs for average sizes of maximal matchings ⋮ Global forcing number for maximal matchings ⋮ Counting the maximal and perfect matchings in benzenoid chains ⋮ On the number of \(r\)-matchings in a tree ⋮ A central limit theorem for almost local additive tree functionals ⋮ Maximal matchings in polyspiro and benzenoid chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Twelve countings with rooted plane trees
• Remarks on an asymptotic method in combinatorics
• The number of trees with a 1-factor
• Trees with 1-factors and oriented trees
• Finite range random walk on free groups and homogeneous trees
• Addendum to: Twelve countings with rooted plane trees
• On an asymptotic method in enumeration
• Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
• Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)
• Singularity Analysis of Generating Functions
• On maximal independent sets of nodes in trees
• Asymptotic Methods in Enumeration
• Coloring rules for finite trees, and probabilities of monadic second order sentences

This page was built for publication: On the number of matchings of a tree