- said to be
almost disjoint. In topology,
there are
various notions of
separated sets with more
strict conditions than
disjointness. For instance, two...
- Look up
disjoint in Wiktionary, the free dictionary.
Disjoint may
refer to:
Disjoint sets, sets with no
common elements Mutual exclusivity, the impossibility...
- 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)...
- In mathematics, the
disjoint union (or
discriminated union) A ⊔ B {\displaystyle A\sqcup B} of the sets A and B is the set
formed from the
elements of...
- the same as the
intersection graph of the sets from the family. The
disjointness graph of G,
denoted D(G), is
constructed in the
following way: for each...
-
almost disjoint if
their intersection is
small in some sense;
different definitions of "small" will
result in
different definitions of "almost
disjoint". The...
- and X {\displaystyle X} are not
almost disjoint (that is,
their intersection is infinite). The
almost disjointness number a {\displaystyle {\mathfrak {a}}}...
-
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...
-
field extension Ω {\displaystyle \Omega } of k are said to be
linearly disjoint over k if the
following equivalent conditions are met: (i) The map A ⊗...
