Search Results for ""

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

In common usage, an ordinal number is an adjective which describes the numerical position of an object, e.g., first, second, third, etc. In formal set theory, an ordinal ...

An ordinary double point of a plane curve is point where a curve intersects itself such that two branches of the curve have distinct tangent lines. Ordinary double points of ...

The intersection H of the three altitudes AH_A, BH_B, and CH_C of a triangle is called the orthocenter. The name was invented by Besant and Ferrers in 1865 while walking on a ...

An out-shuffle, also known as a perfect shuffle (Golomb 1961), is a riffle shuffle in which the top half of the deck is placed in the right hand, and cards are then ...

A palindromic number is a number (in some base b) that is the same when written forwards or backwards, i.e., of the form a_1a_2...a_2a_1. The first few palindromic numbers ...

A palindromic prime is a number that is simultaneously palindromic and prime. The first few (base-10) palindromic primes are 2, 3, 5, 7, 11, 101, 131, 151, 181, 191, 313, ...

The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...

Assume that n numbered pancakes are stacked, and that a spatula can be used to reverse the order of the top k pancakes for 2<=k<=n. Then the pancake sorting problem asks how ...

Starting with the circle P_1 tangent to the three semicircles forming the arbelos, construct a chain of tangent circles P_i, all tangent to one of the two small interior ...