Search Results for ""

The Hatzel graph is a planar hypohamiltonian graph on 57 vertices that was the smallest known example of such a graph until the discovery of the Zamfirescu graph on 48 ...

The terms "measure," "measurable," etc. have very precise technical definitions (usually involving sigma-algebras) that can make them appear difficult to understand. However, ...

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

The simple continued fraction of the Euler-Mascheroni constant gamma is [0; 1, 1, 2, 1, 2, 1, 4, 3, 13, 5, 1, 1, 8, 1, 2, 4, 1, 1, 40, ...] (OEIS A002852). The first few ...

Let A be an n×n real square matrix with n>=2 such that |sum_(i=1)^nsum_(j=1)^na_(ij)s_it_j|<=1 (1) for all real numbers s_1, s_2, ..., s_n and t_1, t_2, ..., t_n such that ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

Scan the decimal expansion of a constant (including any digits to the left of the decimal point) until all n-digit strings have been seen (including 0-padded strings). The ...

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

Let N steps of equal length be taken along a line. Let p be the probability of taking a step to the right, q the probability of taking a step to the left, n_1 the number of ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...