Search Results for ""

A degree set is a set of integers that make up a degree sequence. Any set of positive integers is the degree set for some graph, because any odd integer from that set can be ...

The order-n dipole graph D_n is a multigraph consisting of two vertices and n multiple edges joining them. The dipole graph D_2 is a multigraph that can be considered to ...

Given any real number theta and any positive integer N, there exist integers h and k with 0<k<=N such that |ktheta-h|<1/N. A slightly weaker form of the theorem states that ...

If, for n and d integers, the ratio n/d is itself an integer, then d is said to divide n. This relationship is written d|n, read "d divides n." In this case, n is also said ...

A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...

A term in social choice theory meaning each alternative receives equal weight for a single vote.

For any two ergodic measure-preserving transformations on nonatomic probability spaces, there is an isomorphism between the two probability spaces carrying orbits onto orbits.

If x is a member of a set A, then x is said to be an element of A, written x in A. If x is not an element of A, this is written x not in A. The term element also refers to a ...

A number which can be specified implicitly or explicitly by exponential, logarithmic, and algebraic operations.

A morphism f:Y->X in a category is an epimorphism if, for any two morphisms u,v:X->Z, uf=vf implies u=v. In the categories of sets, groups, modules, etc., an epimorphism is ...