Search Results for ""

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

A set having exactly one element a. A singleton set is denoted by {a} and is the simplest example of a nonempty set.

If {a_0,a_1,...} is a recursive sequence, then the set of all k such that a_k=0 is the union of a finite (possibly empty) set and a finite number (possibly zero) of full ...

Even though real arithmetic is uncountable, it possesses a countable "model."

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...

A formula of first-order logic is said to be in Skolemized form (sometimes also called Skolem standard form or universal form) if it is of the form forall x_1... forall x_nM, ...

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

A roll of two 1s (the lowest roll possible) on a pair of six-sided dice. The probability of rolling snake eyes is 1/36, or 2.777...%.

The 6-polyiamond illustrated above.

Socrates is reported to have stated: "One thing I know is that I know nothing."