Search Results for ""

A square which can be dissected into a number of smaller squares with no two equal is called a perfect square dissection (or a squared square). Square dissections in which ...

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...

A sultan has granted a commoner a chance to marry one of his n daughters. The commoner will be presented with the daughters one at a time and, when each daughter is ...

The Abel prize is a new mathematics prize of the Norwegian Academy of Science and Letters, dedicated to the memory of Niels Henrik Abel (1802-1829) on the occasion of the ...

Probability and Statistics

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

Unlike quadratic, cubic, and quartic polynomials, the general quintic cannot be solved algebraically in terms of a finite number of additions, subtractions, multiplications, ...

The mathematical study of the likelihood and probability of events occurring based on known information and inferred by taking a limited number of samples. Statistics plays ...

The skeleton of the tesseract, commonly denoted Q_4, is a quartic symmetric graph with girth 4 and diameter 4. The automorphism group of the tesseract is of order 2^7·3=384 ...