Disjoint sets
Two sets are said to be disjoint if they have no element in common. For example, and are disjoint sets, while and are not disjoint.
Disjointness can be generalized to several sets in more than one way. One possibility is the notion of pairwise disjoint: a number of sets are pairwise disjoint if every pair of the sets are disjoint. For example, the three sets , and are pairwise disjoint. Alternatively, one can ask for the weaker condition that the sets have empty intersection. For instance, the three sets , and have empty intersection but are not pairwise disjoint.
This article is a stub. Help us out by expanding it.