A short proof of Seymour's 6-flow theorem
- Resource Type
- Working Paper
- Authors
- DeVos, Matt; Nurse, Kathryn
- Source
- Subject
- Mathematics - Combinatorics
- Language
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.
Comment: 2 pages