Search Results for ""

A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...

A Dyck path is a staircase walk from (0,0) to (n,n) that lies strictly below (but may touch) the diagonal y=x. The number of Dyck paths of order n is given by the Catalan ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A polyomino-like object made by attaching squares joined either at sides or corners. Because neighboring squares can be in relation to one another as kings may move on a ...

A finite or infinite square matrix with rational entries. (If the matrix is infinite, all but a finite number of entries in each row must be 0.) The sum or product of two ...

A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...

The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.

Chinese checkers is a game roughly analogous to checkers played on a board in the shape of a centered hexagram. The board has a total of S_5=121 holes, where S_n is a star ...

The problem of finding in how many ways E_n a plane convex polygon of n sides can be divided into triangles by diagonals. Euler first proposed it to Christian Goldbach in ...

If F is a family of more than n bounded closed convex sets in Euclidean n-space R^n, and if every H_n (where H_n is the Helly number) members of F have at least one point in ...