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 Z2 × Z3-flow.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.