A short proof of Seymour's 6-flow theorem

Abstract

We give a compact variation of Seymour's proof that every $2$-edge-connected graph has a nowhere-zero ${\mathbb{Z}}_2\times {\mathbb{Z}}_3$-flow.

2 pages