TOPICS
Search

Search Results for ""


1991 - 2000 of 13134 for Extremal graph theorySearch Results
A magic cube is an n×n×n version of a magic square in which the n^2 rows, n^2 columns, n^2 pillars, and four space diagonals each sum to a single number M_3(n) known as the ...
A game played on a board of a given shape consisting of a number of holes of which all but one are initially filled with pegs. The goal is to remove all pegs but one by ...
A projective plane, sometimes called a twisted sphere (Henle 1994, p. 110), is a surface without boundary derived from a usual plane by addition of a line at infinity. Just ...
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...
A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...
A derangement is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place. For example, the only derangements of {1,2,3} are {2,3,1} and ...
There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...
Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...
A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...
A permutation cycle is a subset of a permutation whose elements trade places with one another. Permutations cycles are called "orbits" by Comtet (1974, p. 256). For example, ...
1 ... 197|198|199|200|201|202|203 ... 1314 Previous Next

...