Search Results for ""

A paradox also known as the surprise examination paradox or prediction paradox. A prisoner is told that he will be hanged on some day between Monday and Friday, but that he ...

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

A famous perceptual illusion in which the brain switches between seeing a young girl and an old woman (or "wife" and "mother in law"). An anonymous German postcard from 1888 ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

van der Waerden's theorem is a theorem about the existence of arithmetic progressions in sets. The theorem can be stated in four equivalent forms. 1. If N=C_1 union C_2 union ...

Zero is the integer denoted 0 that, when used as a counting number, means that no objects are present. It is the only integer (and, in fact, the only real number) that 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 ...

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...