Search Results for ""

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

If S is an infinite set, then the collection F_S={A subset= S:S-A is finite} is a filter called the cofinite (or Fréchet) filter on S.

A group G is said to be finitely generated if there exists a finite set of group generators for G.

A set of points capable of being enclosed in intervals whose total length is arbitrarily small.

A number theoretic function is a function whose domain is the set of positive integers.

"The reals" is a common way of referring to the set of real numbers and is commonly denoted R.

The set of "critical values" of a map u:R^n->R^n of map class C^1 has Lebesgue measure 0 in R^n.

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...