Search Results for ""

Let Q_i denote anything subject to weighting by a normalized linear scheme of weights that sum to unity in a set W. The Kolmogorov axioms state that 1. For every Q_i in W, ...

An odd chordless cycle is a chordless cycle of length >4. A graph is said to be perfect iff neither the graph G nor its graph complement G^_ has an odd chordless cycle. A ...

An array B=b_(ij), i,j>=1 of positive integers is called a dispersion if 1. The first column of B is a strictly increasing sequence, and there exists a strictly increasing ...

The line on which the orthocenter H, triangle centroid G, circumcenter O, de Longchamps point L, nine-point center N, and a number of other important triangle centers lie. ...

Let m(G) be the cycle rank of a graph G, m^*(G) be the cocycle rank, and the relative complement G-H of a subgraph H of G be defined as that subgraph obtained by deleting the ...

Let M be a bounded set in the plane, i.e., M is contained entirely within a rectangle. The outer Jordan measure of M is the greatest lower bound of the areas of the coverings ...

A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal ...

The theorem in set theory and logic that for all sets A and B, B=(A intersection B^_) union (B intersection A^_)<=>A=emptyset, (1) where A^_ denotes complement set of A and ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

There are several theorems known as the "sandwich theorem." In calculus, the squeeze theorem is also sometimes known as the sandwich theorem. In graph theory, the sandwich ...