Search Results for ""

In common usage, a cardinal number is a number used in counting (a counting number), such as 1, 2, 3, .... In formal set theory, a cardinal number (also called "the ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

The word "rank" refers to several related concepts in mathematics involving graphs, groups, matrices, quadratic forms, sequences, set theory, statistics, and tensors. In ...

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 term "natural number" refers either to a member of the set of positive integers 1, 2, 3, ... (OEIS A000027) or to the set of nonnegative integers 0, 1, 2, 3, ... (OEIS ...

A partially ordered set P=(X,<=) is an interval order if it is isomorphic to some set of intervals on the real line ordered by left-to-right precedence. Formally, P is an ...

A set is denumerable iff it is equipollent to the finite ordinal numbers. (Moore 1982, p. 6; Rubin 1967, p. 107; Suppes 1972, pp. 151-152). However, Ciesielski (1997, p. 64) ...

The nth root of the content of the set sum of two sets in n-dimensional Euclidean space is greater than or equal to the sum of the nth roots of the contents of the individual ...

In geometry, the term "enlargement" is a synonym for expansion. In nonstandard analysis, let X be a set of urelements, and let V(X) be the superstructure with individuals in ...