Article ID Journal Published Year Pages File Type
10328737 Discrete Applied Mathematics 2005 7 Pages PDF
Abstract
We prove best-possible upper and lower bounds on the number of matchings in a tree in terms of the number of independent sets and the number of 2-independent sets.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A note on the number of matchings and independent sets in trees
Authors
, , ,