Search Results for ""

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...

The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...

Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...

There are many unsolved problems in mathematics. Some prominent outstanding unsolved problems (as well as some which are not necessarily so well known) include 1. The ...

A vertex-transitive graph, also sometimes called a node symmetric graph (Chiang and Chen 1995), is a graph such that every pair of vertices is equivalent under some element ...

A p-adic number is an extension of the field of rationals such that congruences modulo powers of a fixed prime p are related to proximity in the so called "p-adic metric." ...

A q-series is series involving coefficients of the form (a;q)_n = product_(k=0)^(n-1)(1-aq^k) (1) = product_(k=0)^(infty)((1-aq^k))/((1-aq^(k+n))) (2) = ...

The number 10 (ten) is the basis for the decimal system of notation. In this system, each "decimal place" consists of a digit 0-9 arranged such that each digit is multiplied ...

1729 is sometimes called the Hardy-Ramanujan number. It is the smallest taxicab number, i.e., the smallest number which can be expressed as the sum of two cubes in two ...

The smallest positive composite number and the first even perfect square. Four is the smallest even number appearing in a Pythagorean triple: 3, 4, 5. In the numerology of ...