Search Results for ""
341 - 350 of 2474 for Set PartitionSearch Results

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...
A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...
A set of maximum degree to which all other degrees of recursively enumerable sets can be one-one reduced. If set A is many-one complete, then it is one-one complete, and vice ...
An important and fundamental axiom in set theory sometimes called Zermelo's axiom of choice. It was formulated by Zermelo in 1904 and states that, given any set of mutually ...
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 ...
A Hamilton decomposition (also called a Hamiltonian decomposition; Bosák 1990, p. 123) of a Hamiltonian regular graph is a partition of its edge set into Hamiltonian cycles. ...
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 Julia set with constant c chosen at the boundary of the Mandelbrot set (Branner 1989; Dufner et al. 1998, p. 225). The image above was computed using c=i.
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 ...

...