The algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphs
From MaRDI portal
Publication:658003
DOI10.1016/j.ejc.2011.09.037zbMath1233.05159OpenAlexW2094100914MaRDI QIDQ658003
Publication date: 11 January 2012
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.037
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching polynomials and duality
- The algebra of set functions. I: The product theorem and duality
- A vector space analog of permutations with restricted position
- Hermite polynomials and a duality relation for matchings polynomials
- Convolution structures for Laguerre polynomials
- Weighted permutation problems and Laguerre polynomials
- Problems in algebraic combinatorics
- Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\)
- On the cover polynomial of a digraph
- A short proof of the rook reciprocity theorem
- The \(N\)-dimensional matching polynomial
- Laguerre Polynomials, Weighted Derangements, and Positivity
- Rook Theory. I.: Rook Equivalence of Ferrers Boards
- Permutation Problems and Special Functions
- Derangements and Laguerre polynomials
- Laguerre polynomials and derangements
- Permanents
- Acyclic orientations and the chromatic polynomial
This page was built for publication: The algebra of set functions. II: An enumerative analogue of Hall's theorem for bipartite graphs
