pairwise disjoint

pairwise disjoint

[¦per‚wīz dis′jȯint]
(mathematics)
The property of a collection of sets such that no two members of the collection have any elements in common.
References in periodicals archive ?
All operations maintain the invariants that (1) the segments in I are pairwise disjoint, and (2) the remaining horizontal segments in I form an independent set in the bar visibility graph (of all horizontal segments in the current rectangulation).
It describes the linear or vector space concepts of addition and scalar multiplication, linear subspaces, linear functionals, and hyperplanes, as well as different distances in n-space and the geometric properties of subsets, subspaces, and hyperplanes; topology in the context of metrics derived from a norm on the n-dimensional space; the concept of convexity and the basic properties of convex sets; and Helly's theorem and applications involving transversals of families of pairwise disjoint compact convex subsets of the plane.
We can easily see, by the same method as the proof of Theorem A, that if n + 1 meromorphic functions on C share q pairwise disjoint n-point sets IM, then at least two of them are identical (see, also, Theorem 4).
2,n] is a subset H [subset or equal to] E of pairwise disjoint hyperedges that cover U and V, i.
A plane matching is a plane graph consisting of pairwise disjoint edges.
n], where the In's are pairwise disjoint open intervals.
Note that Ka is a minor of a graph Gif and only if there is a collection {S : A3/4 ca} of nonempty connected and pairwise disjoint subsets of V (G ) such that for all A3/4 y ca with A3/4 s y the sets SA3/4 and Sy are connected to each other.
K] will admit at least n components with pairwise disjoint ranges and, moreover, r([H.
x])}x[member of][OMEGA]] consists of pairwise disjoint cubes, then the number of cubes \I\ in the subfamily satisfies the inequality
alpha]] are pairwise disjoint and there is a bijection [f.
of pairwise disjoint open intervals such that [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (say) is countable and such that each [J'sub.
i], i [member of] I) of pairwise disjoint polygons.