Search Results for ""

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

The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.

For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...

For a fractal process with values y(t-Deltat) and y(t+Deltat), the correlation between these two values is given by the Brown function r=2^(2H-1)-1, also known as the ...

A sequence {nu_i} of nondecreasing positive integers is complete iff 1. nu_1=1. 2. For all k=2, 3, ..., s_(k-1)=nu_1+nu_2+...+nu_(k-1)>=nu_k-1. A corollary states that a ...

An extension of the secant method of root finding to higher dimensions.

A Brunnian link is a set of n linked loops such that each proper sublink is trivial, so that the removal of any component leaves a set of trivial unlinked unknots. The ...

The series producing Brun's constant converges even if there are an infinite number of twin primes, first proved by Brun (1919).

The system of ordinary differential equations u^' = A+u^2v-(B+1)u (1) v^' = Bu-u^2v (2) (Hairer et al. 1987, p. 112; Zwillinger 1997, p. 136). The so-called full Brusselator ...

A paradox arising in the use of comparative adjectives. Suppose you have exactly two brothers, both of whom are older than you are. Then the following apparently false ...