  Let $G$ be the Cartesian product of two finite paths, called a grid, and let
$T$ be the set of eight distinct vertices of $G$, called terminals. Assume that
$T$ is partitioned into four terminal pairs $\{s_i,t_i\}$, $1\leq i\leq 4$, to
be linked in $G$ by using edge disjoint paths. To prove that such a linkage
always exists we need a sequence of technical lemmas making possible for some
terminals to `escape' from a $3\times 3$ corner of $Q\subset G$, called a
`quadrant'. Here we state those lemmas, and give a proof for the cases when $Q$
contains at most $4$ terminals.

Combinatorics