Search Results for ""

A combinatorial conjecture formulated by Kneser (1955). It states that whenever the n-subsets of a (2n+k)-set are divided into k+1 classes, then two disjoint subsets end up ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

The problem of determining how many nonattacking knights K(n) can be placed on an n×n chessboard. For n=8, the solution is 32 (illustrated above). In general, the solutions ...

The Knödel graph W_(Delta,n) is a regular bipartite graph of vertex degree Delta on n nodes for even n>=2 and 1<=Delta<=|_log_2n_| with edges defined as follows. Label the ...

For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...

In mathematics, a knot is defined as a closed, non-self-intersecting curve that is embedded in three dimensions and cannot be untangled to produce a simple loop (i.e., the ...

Let R^3 be the space in which a knot K sits. Then the space "around" the knot, i.e., everything but the knot itself, is denoted R^3-K and is called the knot complement of K ...

The knot curve is a quartic curve with implicit Cartesian equation (x^2-1)^2=y^2(3+2y). (1) The x- and y-intercepts are (0,-1), (0,1/2), and (+/-1,0). It has horizontal ...

The determinant of a knot is defined as |Delta(-1)|, where Delta(z) is the Alexander polynomial (Rolfsen 1976, p. 213).

A knot diagram is a picture of a projection of a knot onto a plane. Usually, only double points are allowed (no more than two points are allowed to be superposed), and the ...