Kessler, David; Schiff, Jeremy Inclusion-exclusion redux. (English) Zbl 1008.60016 Electron. Commun. Probab. 7, Paper No. 9, 85-96 (2002). 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. Cited in 1 Document MSC: 60C05 Combinatorial probability Keywords:inclusion-exclusion principle; close-to-independent events PDFBibTeX XMLCite \textit{D. Kessler} and \textit{J. Schiff}, Electron. Commun. Probab. 7, Paper No. 9, 85--96 (2002; Zbl 1008.60016) Full Text: DOI EuDML EMIS