Search Results for ""

Let G_1, G_2, ..., G_t be a t-graph edge coloring of the complete graph K_n, where for each i=1, 2, ..., t, G_i is the spanning subgraph of K_n consisting of all graph edges ...

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

The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...

The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...

A version of set theory which is a formal system expressed in first-order predicate logic. Zermelo-Fraenkel set theory is based on the Zermelo-Fraenkel axioms. ...

For a particular format in the IEEE 754-2008 framework, a normal number is a finite nonzero floating-point number with magnitude greater than or equal to a minimum value ...

The term "higher dimensional group theory" was introduced by Brown (1982), and refers to a method for obtaining new homotopical information by generalizing to higher ...

For a Galois extension field K of a field F, the fundamental theorem of Galois theory states that the subgroups of the Galois group G=Gal(K/F) correspond with the subfields ...

A Thâbit ibn Kurrah number, sometimes called a 321-number, is a number of the form K_n=3·2^n-1. The first few for n=0, 1, ... are 2, 5, 11, 23, 47, 95, 191, 383, 767, ... ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...