Search Results for ""

A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.

Wang's conjecture states that if a set of tiles can tile the plane, then they can always be arranged to do so periodically (Wang 1961). The conjecture was refuted when Berger ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

Given a function f(x) plotted in the Cartesian plane as y=f(x), the average rate of change (or average rate of change function) of f from x to a is given by ...

The catacaustic of a cardioid for a radiant point along the x-axis is complicated function of x. For x=0 (i.e., with radiant point at the cusp), however, the catacaustic for ...

The proposition that every consistent generalized theory has a model. The theorem is true if the axiom of choice is assumed.

A p-form alpha is indecomposable if it cannot be written as the wedge product of one-forms alpha=beta_1 ^ ... ^ beta_p. A p-form that can be written as such a product is ...

In a category C, an initial object is an object I in Ob(C) such that for any other object X in Ob(C), there is one and only one morphism from I to X.

An involutive algebra is an algebra A together with a map a|->a^* of A into A (a so-called involution), satisfying the following properties: 1. (a^*)^*=a. 2. (ab)^*=b^*a^*. ...

A linear transformation of period two. Since a linear transformation has the form, lambda^'=(alphalambda+beta)/(gammalambda+delta), (1) applying the transformation a second ...