Search Results for ""

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

product_(k=1)^(infty)(1-x^k) = sum_(k=-infty)^(infty)(-1)^kx^(k(3k+1)/2) (1) = 1+sum_(k=1)^(infty)(-1)^k[x^(k(3k-1)/2)+x^(k(3k+1)/2)] (2) = (x)_infty (3) = ...

Let G be a Lie group and let rho be a group representation of G on C^n (for some natural number n), which is continuous in the sense that the function G×C^n->C^n defined by ...

A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...

Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...

A primefree sequence is sequence whose terms are never prime. Graham (1964) proved that there exist relatively prime positive integers a and b such that the recurrence ...

A quintic nonhamiltonian graph is a quintic graph that is nonhamiltonian. A number of such graphs are illustrated above. Owens (1980) showed that there exists a ...

A round number is a number that is the product of a considerable number of comparatively small factors (Hardy 1999, p. 48). Round numbers are very rare. As Hardy (1999, p. ...

Let K_1 be a knot inside a torus, and knot the torus in the shape of a second knot (called the companion knot) K_2, with certain additional mild restrictions to avoid trivial ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...