Search Results for ""

A matching is a maximum matching iff it contains no augmenting path.

A term of endearment used by algebraic topologists when talking about their favorite power tools such as Abelian groups, bundles, homology groups, homotopy groups, K-theory, ...

Percolation, the fundamental notion at the heart of percolation theory, is a difficult idea to define precisely though it is quite easy to describe qualitatively. From the ...

A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.

One of Cantor's ordinal numbers omega, omega+1, omega+2, ..., omega+omega, omega+omega+1, ... which is "larger" than any whole number.

An important and fundamental axiom in set theory sometimes called Zermelo's axiom of choice. It was formulated by Zermelo in 1904 and states that, given any set of mutually ...

A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...

The points on a line can be put into a one-to-one correspondence with the real numbers.

Given the direct sum of additive Abelian groups A direct sum B, A and B are called direct summands. The map i_1:A-->A direct sum B defined by i(a)=a direct sum 0 is called ...

A ring in which the zero ideal is an irreducible ideal. Every integral domain R is irreducible since if I and J are two nonzero ideals of R, and a in I, b in J are nonzero ...