Search Results for ""

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...

The series of Sturm functions arising in application of the Sturm theorem.

Any sum of a selection of Pi_ks, where Pi_k denotes a k-D polytope.

A k-chain whose bounding (k-1)-chain vanishes.

An almost alternating link with a single component.

Any link can be represented by a closed braid.

A number n for which a shortest chain exists (which is also a Hansen chain) is called a Hansen number.

A number n for which a shortest chain exists which is a Brauer chain is called a Brauer number. There are infinitely many non-Brauer numbers.

For a partial order, the size of the longest chain is called the length.

A diagram lemma which states that every short exact sequence of chain complexes and chain homomorphisms 0-->C-->^phiD-->^psiE-->0 gives rise to a long exact sequence in ...