disjoint
91Set (game) — Set! redirects here. Set! is also a special form in the Scheme programming language. Set is a real time card game designed by Marsha Falco and published by Set Enterprises in 1991. The deck consists of 81 cards varying in four features: number… …
92Kruskal's algorithm — is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is… …
93Addition — is the mathematical process of putting things together. The plus sign + means that two numbers are added together. For example, in the picture on the right, there are 3 + 2 apples meaning three apples and two other apples which is the same as… …
94König's theorem (set theory) — For other uses, see König s theorem. In set theory, König s theorem (named after the Hungarian mathematician Gyula König) colloquially states that if the axiom of choice holds, I is a set, mi and ni are cardinal numbers for every i in I , and m i …
95Tangent bundle — In mathematics, the tangent bundle of a smooth (or differentiable) manifold M , denoted by T ( M ) or just TM , is the disjoint unionThe disjoint union assures that for any two points x 1 and x 2 of manifold M the tangent spaces T 1 and T 2 have… …
96Projective space — In mathematics a projective space is a set of elements constructed from a vector space such that a distinct element of the projective space consists of all non zero vectors which are equal up to a multiplication by a non zero scalar. A formal… …
97Covering space — A covering map satisfies the local triviality condition. Intuitively, such maps locally project a stack of pancakes above an open region, U, onto U. In mathematics, more specifically algebraic topology, a covering map is a continuous surjective… …
98Solid modeling — The geometry in solid modeling is fully described in 3‑D space; objects can be viewed from any angle. Modeled and ray traced in Cobalt Solid modeling (or modelling) is a consistent set of principles for mathematical and computer modeling of three …
99Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue …
100Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …
