Search Results for ""

A space X is locally pathwise-connected if for every neighborhood around every point in X, there is a smaller, pathwise-connected neighborhood.

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

If a sphere is covered by three closed sets, then one of them must contain a pair of antipodal points.

A tree not having the complete bipartite graph K_(1,2) with base at the vertex of degree two as a limb (Lu et al. 1993, Lu 1996).

The four planes determined by the four altitudes of a tetrahedron and the orthocenters of the corresponding faces pass through the Monge point of the tetrahedron.

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

A stable fixed point of a map which, in a dissipative dynamical system, is an attractor.

Let Y^X be the set of continuous mappings f:X->Y. Then the topological space for Y^X supplied with a compact-open topology is called a mapping space.

A sequence X_1, X_2, ... of random variates is called Markov (or Markoff) if, for any n, F(X_n|X_(n-1),X_(n-2),...,X_1)=F(X_n|X_(n-1)), i.e., if the conditional distribution ...

A set of vectors is maximally linearly independent if including any other vector in the vector space would make it linearly dependent (i.e., if any other vector in the space ...