On the number of matchings of a tree

DOI10.1016/J.EJC.2006.01.014MaRDI QIDQ875067zbMATH OpenOpenAlexFDO

Authors Stephan 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

treesenumerationmatchings

Mathematics Subject Classification ID

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

Recommendations

• The number of maximum matchings in a tree
• Enumeration of matchings in complete \(q\)-ary trees
• scientific article; zbMATH DE number 3895093
• Generalized matchings in trees
• Klazar trees and perfect matchings

Cites work

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

Cited in

(23)

• Maximal matchings in polyspiro and benzenoid chains
• Generalized matchings in trees
• Extremal graphs for average sizes of maximal matchings
• A central limit theorem for almost local additive tree functionals
• On the number of \(F\)-matchings in a tree
• The number of \(F\)-matchings in almost every tree is a zero residue
• Enumeration of matchings in complete \(q\)-ary trees
• Alternating Whitney sums and matchings in trees. II
• scientific article; zbMATH DE number 3895093 (Why is no real title available?)
• The number of maximum matchings in a tree
• Perfect matchings and \(k\)-decomposability of increasing trees
• Klazar trees and perfect matchings
• Counting matchings and tree-like walks in regular graphs
• Trees with maximum number of maximal matchings
• The average size of matchings in graphs
• Counting the maximal and perfect matchings in benzenoid chains
• Alternating Whitney sums and matchings in trees. 1
• Global forcing number for maximal matchings
• Matchings on trees and the adjacency matrix: A determinantal viewpoint
• Asymptotic normality of almost local functionals in conditioned Galton-Watson trees
• On the number of \(r\)-matchings in a tree
• scientific article; zbMATH DE number 6499273 (Why is no real title available?)
• Number of pairs of template matchings in \(q\)-ary tree with randomly marked vertices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875067)