Search Results for ""

Yahtzee is a game played with five 6-sided dice. Players take turns rolling the dice, and trying to get certain types of rolls, each with an assigned point value, as ...

A set of n cells in an n×n square such that no two come from the same row and no two come from the same column. The number of transversals of an n×n square is n! (n ...

The complex plane is the plane of complex numbers spanned by the vectors 1 and i, where i is the imaginary number. Every complex number corresponds to a unique point in the ...

The sequence of numbers {j_n} giving the number of digits in the three-fold power tower n^(n^n). The values of n^(n^n) for n=1, 2, ... are 1, 16, 7625597484987, ... (OEIS ...

The party problem, also known as the maximum clique problem, asks to find the minimum number of guests that must be invited so that at least m will know each other or at ...

The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

Q is said to be tightly embedded if |Q intersection Q^g| is odd for all g in G-N_G(Q), where N_G(Q) is the normalizer of Q in G.