Search Results for ""

A k-colored graph is a labeled k-colorable graph together with its coloring function (Finch 2003).

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.

A p-elementary subgroup of a finite group G is a subgroup H which is the group direct product H=C_n×P, where P is a p-group, C_n is a cyclic group, and p does not divide n.

A p-system of a set S is a sequence of subsets A_1, A_2, ..., A_p of S, among which some may be empty or coinciding with each other.

An accumulation point is a point which is the limit of a sequence, also called a limit point. For some maps, periodic orbits give way to chaotic ones beyond a point known as ...

For P, Q, R, and S polynomials in n variables [P·Q,R·S]=sum_(i_1,...,i_n>=0)A/(i_1!...i_n!), (1) where A=[R^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n) ...

The conjecture made by Belgian mathematician Eugène Charles Catalan in 1844 that 8 and 9 (2^3 and 3^2) are the only consecutive powers (excluding 0 and 1). In other words, ...

A gadget defined for complex vector bundles. The Chern classes of a complex manifold are the Chern classes of its tangent bundle. The ith Chern class is an obstruction to the ...

A perspective collineation in which the center and axis are incident.

Values one step outside the hinges are called inner fences, and values two steps outside the hinges are called outer fences. Tukey calls values outside the outer fences far ...