An Operator Approach to the Principle of Inclusion and Exclusion
From MaRDI portal
Publication:3718721
DOI10.2307/2046609zbMath0591.05004OpenAlexW4241779643MaRDI QIDQ3718721
No author found.
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2046609
Trees (05C05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
Cites Work
- Unnamed Item
- Unnamed Item
- Garsia and Milne's bijective proof of the inclusion-exclusion principle
- An operator approach to some graph enumeration problems
- Enumeration of connected spanning subgraphs of a planar graph
- Matrix tree theorems
- Averages by the sieve method
- The Number of Components in Random Linear Graphs
- On Operator and Formal Sum Methods for Graph Enumeration Problems
- Enumeration of Forests in a Graph
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
This page was built for publication: An Operator Approach to the Principle of Inclusion and Exclusion