Search Results for ""

The Franklin graph is the 12-vertex cubic graph shown above whose embedding on the Klein bottle divides it into regions having a minimal coloring using six colors, thus ...

The Klein bottle crossing number of a graph G is the minimum number of crossings possible when embedding G on a Klein bottle (cf. Garnder 1986, pp. 137-138). While the ...

A prime constellation of four successive primes with minimal distance (p,p+2,p+6,p+8). The term was coined by Paul Stäckel (1892-1919; Tietze 1965, p. 19). The quadruplet (2, ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

A quantity such as a polynomial discriminant which remains unchanged under a given class of algebraic transformations. Such invariants were originally called ...

The atom-spiral, also known as the atomic spiral, is the curve with polar equation r=theta/(theta-a) for a real parameter a (van Maldeghem 2002). When theta is allows to vary ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

Bit rate (i.e., bits per second, abbreviated bps) is a measure of the number of data bits (digital 0s and 1s) transmitted each second in a digital communications channel. If ...

Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...

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 ...