Search Results for ""

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs, including the Herschel graph and the Goldner-Harary ...

A separable extension K of a field F is one in which every element's algebraic number minimal polynomial does not have multiple roots. In other words, the minimal polynomial ...

A maximal independent edge set of a graph is an independent edge set that cannot be expanded to another independent edge set by addition of any edge in the graph. Note that a ...

"Chaos" is a tricky thing to define. In fact, it is much easier to list properties that a system described as "chaotic" has rather than to give a precise definition of chaos. ...

A dozen dozen, also called a gross. 144 is a square number and a sum-product number.

The very large number consisting of the number 2 inside a mega-gon.

The number of degrees of freedom in a problem, distribution, etc., is the number of parameters which may be independently varied.

An inaccessible cardinal is a cardinal number which cannot be expressed in terms of a smaller number of smaller cardinals.

A game in which each player has a finite number of moves and a finite number of choices at each move.

B_(p+k)=B_k+B_(k+1) (mod p), when p is prime and B_n is a Bell number.