Search Results for ""

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

The necker cube is an illusion in which a two-dimensional drawing of an array of cubes appears to simultaneously protrude from and intrude into the page. A Necker cube ...

Given an arrangement of points, a line containing just two of them is called an ordinary line. Dirac (1951) conjectured that every sufficiently set of n noncollinear points ...

A power series in a variable z is an infinite sum of the form sum_(i=0)^inftya_iz^i, where a_i are integers, real numbers, complex numbers, or any other quantities of a given ...

A prime constellation of four successive primes with minimal distance (p,p+2,p+6,p+8). The term was coined by Paul Stäckel (1892-1919; Tietze 1965, p. 19). The quadruplet (2, ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

A primality test that provides an efficient probabilistic algorithm for determining if a given number is prime. It is based on the properties of strong pseudoprimes. The ...

In 1913, Ramanujan asked if the Diophantine equation of second order 2^n-7=x^2, sometimes called the Ramanujan-Nagell equation, has any solutions other than n=3, 4, 5, 7, and ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

Given the closed interval [0,x] with x>1, let one-dimensional "cars" of unit length be parked randomly on the interval. The mean number M(x) of cars which can fit (without ...