The algebra of set functions II: An enumerative analogue of Hall's theorem for bipartite graphs

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.