An Operator Approach to the Principle of Inclusion and Exclusion
From MaRDI portal
Recommendations
Cites work
- An operator approach to some graph enumeration problems
- Averages by the sieve method
- Enumeration of connected spanning subgraphs of a planar graph
- Enumeration of Forests in a Graph
- Garsia and Milne's bijective proof of the inclusion-exclusion principle
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3152798 (Why is no real title available?)
- Matrix tree theorems
- On Operator and Formal Sum Methods for Graph Enumeration Problems
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- The Number of Components in Random Linear Graphs
Cited in
(5)- Enumeration of cubic graphs by inclusion-exclusion
- Inclusion and exclusion for finitely many types of properties
- scientific article; zbMATH DE number 123387 (Why is no real title available?)
- Principle of inclusion-exclusion and its applications for combinatorial enumeration of circular alternating permutation
- On two qualitative approaches to tolerant inclusion operators
This page was built for publication: An Operator Approach to the Principle of Inclusion and Exclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718721)