Inclusion-Exclusion Redux
David A. Kessler, Jeremy Schiff · Electronic Communications in Probability · 2002
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.