Discrete Mathematics & Theoretical Computer Science (Dec 2000)
Improved inclusion-exclusion identities via closure operators
Abstract
Let (A v) v ∈ V be a finite family of sets. We establish an improved inclusion-exclusion identity for each closure operator on the power set of V having the unique base property. The result generalizes three improvements of the inclusion-exclusion principle as well as Whitney's broken circuit theorem on the chromatic polynomial of a graph.