Search results

and formal logic, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is...

Look up disjoint in Wiktionary, the free dictionary. Disjoint may refer to: Disjoint sets, sets with no common elements Mutual exclusivity, the impossibility...

belongs to exactly one of these images). A disjoint union of a family of pairwise disjoint sets is their union. In category theory, the disjoint union is...

a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection of disjoint (non-overlapping)...

equipping the disjoint union of the underlying sets with a natural topology called the disjoint union topology. Roughly speaking, in the disjoint union the...

called edge-disjoint or simply disjoint cycle cover. Similar definitions exist for digraphs, in terms of directed cycles. Finding a vertex-disjoint cycle cover...

mathematics, the disjoint union of graphs is an operation that combines two or more graphs to form a larger graph. It is analogous to the disjoint union of sets...

almost disjoint if their intersection is small in some sense; different definitions of "small" will result in different definitions of "almost disjoint". The...

said to be linearly disjoint over k if the following equivalent conditions are met: (i) The map A ⊗ k B → A B {\displaystyle A\otimes _{k}B\to AB} induced...

topological space X that satisfies Axiom T4: every two disjoint closed sets of X have disjoint open neighborhoods. A normal Hausdorff space is also called...

analysis, two elements x and y of a vector lattice X are lattice disjoint or simply disjoint if inf { | x | , | y | } = 0 {\displaystyle \inf \left\{|x|,|y|\right\}=0}...

union of two or more disjoint non-empty open subsets. Connectedness is one of the principal topological properties that are used to distinguish topological...

largest open set disjoint from S , {\displaystyle S,} namely, it is the union of all open sets in X {\displaystyle X} that are disjoint from S . {\displaystyle...

disjoint shortest pair algorithm is an algorithm in computer network routing. The algorithm is used for generating the shortest pair of edge disjoint...

use of topological means to distinguish disjoint sets and distinct points. It's not enough for elements of a topological space to be distinct (that is, unequal);...

{\displaystyle X} can be considered to be separated. A most basic way in which two sets can be separated is if they are disjoint, that is, if their intersection...

In geometry, the hyperplane separation theorem is a theorem about disjoint convex sets in n-dimensional Euclidean space. There are several rather similar...

in a finite graph, the size of a minimum cut set is equal to the maximum number of disjoint paths that can be found between any pair of vertices. Proved...

structures has the strong amalgamation property (SAP), also called the disjoint amalgamation property (DAP), if for every amalgam with A,B,C ∈ K there...

to cover, up to a Lebesgue-negligible set, a given subset E of Rd by a disjoint family extracted from a Vitali covering of E. There are two basic versions...