Abstract
We present a reordered version of the inclusion-exclusion principle, which is useful when computing the probability of a union of events which are close to independent. The advantages of this formulation are demonstrated in the context of 3 classic problems in combinatorics.
Citation
David Kessler. Jeremy Schiff. "Inclusion-Exclusion Redux." Electron. Commun. Probab. 7 85 - 96, 2002. https://doi.org/10.1214/ECP.v7-1050
Information