×

Inclusion-exclusion redux. (English) Zbl 1008.60016

Summary: 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 three classical problems in combinatorics.

MSC:

60C05 Combinatorial probability
PDFBibTeX XMLCite
Full Text: DOI EuDML EMIS