Search Results for ""

Let m(G) be the cycle rank of a graph G, m^*(G) be the cocycle rank, and the relative complement G-H of a subgraph H of G be defined as that subgraph obtained by deleting the ...

A subset G subset R of the real numbers is said to be a G_delta set provided G is the countable intersection of open sets. The name G_delta comes from German: The G stands ...

Let M be a bounded set in the plane, i.e., M is contained entirely within a rectangle. The outer Jordan measure of M is the greatest lower bound of the areas of the coverings ...

A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal ...

Let T be a linear operator on a separable Hilbert space. The spectrum sigma(T) of T is the set of lambda such that (T-lambdaI) is not invertible on all of the Hilbert space, ...

The theorem in set theory and logic that for all sets A and B, B=(A intersection B^_) union (B intersection A^_)<=>A=emptyset, (1) where A^_ denotes complement set of A and ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

There are several theorems known as the "sandwich theorem." In calculus, the squeeze theorem is also sometimes known as the sandwich theorem. In graph theory, the sandwich ...

Let X be a set. Then a sigma-algebra F is a nonempty collection of subsets of X such that the following hold: 1. X is in F. 2. If A is in F, then so is the complement of A. ...

The base-2 transcendental number 0.11011011111011011111..._2 (1) (OEIS A014578), where the nth bit is 1 if n is not divisible by 3 and is the complement of the (n/3)th bit if ...