Partition the set of indices formula 89 into formula 90 disjoint subsets formula 91. Every permutation on finitely many elements can be decomposed into cycles on disjoint orbits. In the case of topological spaces coproducts are disjoint unions with their disjoint union topologies. A domatic partition is a partition of the vertices into disjoint dominating sets. Let formula 92, where all the sets formula 93 are pairwise disjoint. The disjoint union of a family of pairwise disjoint sets is their set union. The cosets generated by a specific subgroup are either identical to each other or disjoint. Curves whose interior zones do not intersect represent disjoint sets. A matching in a hypergraph is a set of disjoint hyperedges. Consider a collection of disjoint and bounded subregions of the underlying space. The 120-cell can be decomposed into two disjoint tori. Both sets are distinct, even disjoint. In simple type theory objects are elements of various disjoint "types". Mathematically, tagged unions correspond to "disjoint" or "discriminated unions", usually written using +. This graph is a union of disjoint cycles if the automaton is bireversible.