Search Results for ""

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

Bowling, known as "ten pins" throughout most of the world, is a game played by rolling a heavy ball down a long narrow track and attempting to knock down ten pins arranged in ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

A node which is one graph edge further away from a given node in a rooted tree.

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.

Let the difference of successive primes be defined by d_n=p_(n+1)-p_n, and d_n^k by d_n^k={d_n for k=1; |d_(n+1)^(k-1)-d_n^(k-1)| for k>1. (1) N. L. Gilbreath claimed that ...

In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...

A quotient-difference table is a triangular array of numbers constructed by drawing a sequence of n numbers in a horizontal row and placing a 1 above each. An additional "1" ...

The square-triangle theorem states that any nonnegative integer can be represented as the sum of a square, an even square, and a triangular number (Sun 2005), i.e., ...