Search Results for ""

The number of nodes in a graph is called its order.

The operation of taking an nth root of a number.

B_(p+k)=B_k+B_(k+1) (mod p), when p is prime and B_n is a Bell number.

The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

The m×n king graph is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a king. The number ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

Minkowski's question mark function is the function y=?(x) defined by Minkowski for the purpose of mapping the quadratic surds in the open interval (0,1) into the rational ...

De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...