Search Results for ""

A Mycielski graph M_k of order k is a triangle-free graph with chromatic number k having the smallest possible number of vertices. For example, triangle-free graphs with ...

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...

A second-order algebraic surface given by the general equation (1) Quadratic surfaces are also called quadrics, and there are 17 standard-form types. A quadratic surface ...

An algorithm similar to Neville's algorithm for constructing the Lagrange interpolating polynomial. Let f(x|x_0,x_1,...,x_k) be the unique polynomial of kth polynomial order ...

A branch point whose neighborhood of values wrap around the range a finite number of times p as their complex arguments theta varies from 0 to a multiple of 2pi is called an ...

Given a ship with a known constant direction and speed v, what course should be taken by a chase ship in pursuit (traveling at speed V) in order to intercept the other ship ...

(dy)/(dx)+p(x)y=q(x)y^n. (1) Let v=y^(1-n) for n!=1. Then (dv)/(dx)=(1-n)y^(-n)(dy)/(dx). (2) Rewriting (1) gives y^(-n)(dy)/(dx) = q(x)-p(x)y^(1-n) (3) = q(x)-vp(x). (4) ...

The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...

A roll of two 6s (the highest roll possible) on a pair of 6-sided dice. The probability of rolling boxcars in a single roll of two dice is 1/36, or 2.777...%. In order to ...

There are at least two theorems known as Chebyshev's theorem. The first is Bertrand's postulate, proposed by Bertrand in 1845 and proved by Chebyshev using elementary methods ...