Search Results for ""

A set is denumerable iff it is equipollent to the finite ordinal numbers. (Moore 1982, p. 6; Rubin 1967, p. 107; Suppes 1972, pp. 151-152). However, Ciesielski (1997, p. 64) ...

The Faulkner-Younger graphs (Faulkner and Younger 1974) are the cubic polyhedral nonhamiltonian graphs on 42 and 44 vertices illustrated above that are counterexamples to ...

Let X(x)=X(x_1,x_2,...,x_n) be a random vector in R^n and let f_X(x) be a probability distribution on X with continuous first and second order partial derivatives. The Fisher ...

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 ...

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 ...

A property that passes from a topological space to every subspace with respect to the relative topology. Examples are first and second countability, metrizability, the ...

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 ...

For a rectangular hyperbola x = asect (1) y = atant (2) with inversion center at the origin, the inverse curve is x_i = (2kcost)/(a[3-cos(2t)]) (3) y_i = ...

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 ...