####

#### A Cantor-Bernstein theorem for paths in graphs

We give two short proofs of Pym's Cantor-Bernstein analogue
for systems of disjoint paths in graphs. The first is a particularly
simple proof by transfinite induction, the second is a short (but
slightly more technical) proof not using the axiom of choice.

Download (PDF)