Search Results for ""

It is possible to describe a set of positive integers that cannot be listed in a book containing a set of counting numbers on each consecutively numbered page. Another form ...

The complement of a graph G, sometimes called the edge-complement (Gross and Yellen 2006, p. 86), is the graph G^', sometimes denoted G^_ or G^c (e.g., Clark and Entringer ...

An urelement contains no elements, belongs to some set, and is not identical with the empty set (Moore 1982, p. 3; Rubin 1967, p. 23). "Ur" is a German prefix which is ...

A number x such that for all epsilon>0, there exists a member of the set y different from x such that |y-x|<epsilon. The topological definition of limit point P of A is that ...

A set in R^n which can be reduced to one of its points, say P, by a continuous deformation, is said to be contractible. The transformation is such that each point of the set ...

The backslash symbol \ is used to denote a set difference, quotient group, or integer division.

The problem of finding all independent irreducible algebraic relations among any finite set of quantics.

Given a set X, a set function mu^*:2^X->[0,infty] is said to be an outer measure provided that mu^*(emptyset)=0 and that mu^* is countably monotone, where emptyset is the ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

A Brunnian link is a set of n linked loops such that each proper sublink is trivial, so that the removal of any component leaves a set of trivial unlinked unknots. The ...