Search Results for ""

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A minor M_(ij) is the reduced determinant of a determinant expansion that is formed by omitting the ith row and jth column of a matrix A. So, for example, the minor M_(22) of ...

A multivalued function, also known as a multiple-valued function (Knopp 1996, part 1 p. 103), is a "function" that assumes two or more distinct values in its range for at ...

The first Napoleon point N is the concurrence of lines drawn between vertices of a given triangle DeltaABC and the opposite vertices of the corresponding inner Napoleon ...

Let F,G:C->D be functors between categories C and D. A natural transformation Phi from F to G consists of a family Phi_C:F(C)->G(C) of morphisms in D which are indexed by the ...

A nilpotent Lie group is a Lie group G which is connected and whose Lie algebra is a nilpotent Lie algebra g. That is, its Lie algebra lower central series ...

A set X is said to be nowhere dense if the interior of the set closure of X is the empty set. For example, the Cantor set is nowhere dense. There exist nowhere dense sets of ...

An operator A:f^((n))(I)|->f(I) assigns to every function f in f^((n))(I) a function A(f) in f(I). It is therefore a mapping between two function spaces. If the range is on ...

An outlier is an observation that lies outside the overall pattern of a distribution (Moore and McCabe 1999). Usually, the presence of an outlier indicates some sort of ...