inclusion–exclusion principle
Sign in to saveAlso known as inclusion-exclusion principle
counting technique in combinatorics
In the Vinony graph
Vinony's link graph records 70 inbound references to inclusion–exclusion principle, and connects out to natural number, De Morgan's laws and measure.
Vinony files it under Abraham de Moivre, Enumerative combinatorics and Mathematical principles.
Vinony links it to 32 Wikipedia language editions.
Wikidata facts
Show 1 more fact
- maintained by WikiProject
- WikiProject Mathematics
Sources (2)
via Wikidata · CC0
~39 min read
Encyclopedic overview
Venn diagram showing the union of sets A and B as everything not in white
In combinatorics, the inclusion–exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements in the union of two finite sets; symbolically expressed as
Excerpted from Wikipedia’s “inclusion–exclusion principle” article, available under the CC BY-SA 4.0 licence.