Search Results for ""

The edge chromatic number, sometimes also called the chromatic index, of a graph G is fewest number of colors necessary to color each edge of G such that no two edges ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...

Fermat's 4n+1 theorem, sometimes called Fermat's two-square theorem or simply "Fermat's theorem," states that a prime number p can be represented in an essentially unique ...

A free idempotent monoid is a monoid that satisfies the identity x^2=x and is generated by a set of elements. If the generating set of such a monoid is finite, then so is the ...

The graph strong product, also known as the graph AND product or graph normal product, is a graph product variously denoted G□AdjustmentBox[x, BoxMargins -> {{-0.65, ...

A representation of a group G is a group action of G on a vector space V by invertible linear maps. For example, the group of two elements Z_2={0,1} has a representation phi ...

If J is a simple closed curve in R^2, then the Jordan curve theorem, also called the Jordan-Brouwer theorem (Spanier 1966) states that R^2-J has two components (an "inside" ...

A collection of identities which hold on a Kähler manifold, also called the Hodge identities. Let omega be a Kähler form, d=partial+partial^_ be the exterior derivative, ...

There are two distinct entities both known as the Lagrange number. The more common one arises in rational approximation theory (Conway and Guy 1996), while the other refers ...

A multiway system is a kind of substitution system in which multiple states are permitted at any stage. This accommodates rule systems in which there is more than one ...