Search Results for ""

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

A series is an infinite ordered set of terms combined together by the addition operator. The term "infinite series" is sometimes used to emphasize the fact that series ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...

Togliatti (1940, 1949) showed that quintic surfaces having 31 ordinary double points exist, although he did not explicitly derive equations for such surfaces. Beauville ...

Backgammon is a board game played by two players. The backgammon board is divided into four sections of six triangular regions on which pieces may be placed. Brown and white ...

A generalization of the factorial and double factorial, n! = n(n-1)(n-2)...2·1 (1) n!! = n(n-2)(n-4)... (2) n!!! = n(n-3)(n-6)..., (3) etc., where the products run through ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

Consider the process of taking a number, taking its digit sum, then adding the digits of numbers derived from it, etc., until the remaining number has only one digit. The ...

1 1 2 2 3 5 5 7 10 15 15 20 27 37 52 The Bell triangle, also called Aitken's array or the Peirce triangle (Knuth 2005, p. 28), is the number triangle obtained by beginning ...