Search Results for ""

The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph. It is implemented in the ...

An H-space, named after Heinz Hopf, and sometimes also called a Hopf space, is a topological space together with a continuous binary operation mu:X×X->X, such that there ...

A Hajós group is a group for which all factorizations of the form (say) Z_n=A direct sum B have A or B periodic, where the period is a divisor of n. Hajós groups arose after ...

Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...

The invertible matrix theorem is a theorem in linear algebra which gives a series of equivalent conditions for an n×n square matrix A to have an inverse. In particular, A is ...

The Ishango bone is the oldest known object containing logical carvings. It was discovered in the Congo, and has been dated to be 22000 years old. The middle column of marks ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

The Komornik-Loreti constant is the value q such that 1=sum_(n=1)^infty(t_k)/(q^k), (1) where {t_k} is the Thue-Morse sequence, i.e., t_k is the parity of the number of 1's ...

The Lebesgue integral is defined in terms of upper and lower bounds using the Lebesgue measure of a set. It uses a Lebesgue sum S_n=sum_(i)eta_imu(E_i) where eta_i is the ...

Consider a game where everyone in a classroom picks a number between 0 and 100. The person closest to half the average wins. Obviously, picking a number over 50 would be ...