| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653921 | European Journal of Combinatorics | 2012 | 16 Pages |
Abstract
This formula follows from a general duality theory which we develop for counting matchings. Moreover, we make use of generating functions for set functions as introduced by Lass [20], and we show how they are useful for counting matchings in bipartite graphs in many different ways.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Bodo Lass,