Search Results for ""

Every sufficiently large odd number is a sum of three primes (Vinogradov 1937). Ramachandra and Sankaranarayanan (1997) have shown that for sufficiently large n, the error ...

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. This partitions graphs into ...

The Voronov-Neopryatnaya-Dergachev graphs are two graphs on 372 and 972 vertices which have unit-distance embeddings with all vertices on a sphere and chromatic number 5. The ...

The voter model is a simple mathematical model of opinion formation in which voters are located at the nodes of a network, each voter has an opinion (in the simplest case, 0 ...

A basin of attraction in which every point on the common boundary of that basin and another basin is also a boundary of a third basin. In other words, no matter how closely a ...

Let X_1, ..., X_N be a sequence of independent observations of a random variable X, and let the number of observations N itself be chosen at random. Then Wald's equation ...

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

Let F_n be the nth Fibonacci number, and let (p|5) be a Legendre symbol so that e_p=(p/5)={1 for p=1,4 (mod 5); -1 for p=2,3 (mod 5). (1) A prime p is called a Wall-Sun-Sun ...

Two polygons are congruent by dissection iff they have the same area. In particular, any polygon is congruent by dissection to a square of the same area. Laczkovich (1988) ...