1. A new proof of Seymour's 6-flow theorem
- Author
-
Robert Šámal, Matt DeVos, and Edita Rollová
- Subjects
Mathematics::Combinatorics ,Conjecture ,010102 general mathematics ,0102 computer and information sciences ,Nowhere-zero flow ,01 natural sciences ,Graph ,Theoretical Computer Science ,Combinatorics ,Computational Theory and Mathematics ,Computer Science::Discrete Mathematics ,010201 computation theory & mathematics ,FOS: Mathematics ,Mathematics - Combinatorics ,Discrete Mathematics and Combinatorics ,Combinatorics (math.CO) ,0101 mathematics ,Computer Science::Data Structures and Algorithms ,Mathematics - Abstract
Tutte's famous 5-flow conjecture asserts that every bridgeless graph has a nowhere-zero 5-flow. Seymour proved that every such graph has a nowhere-zero 6-flow. Here we give (two versions of) a new proof of Seymour's Theorem. Both are roughly equal to Seymour's in terms of complexity, but they offer an alternative perspective which we hope will be of value., Comment: 8 pages, 1 figure
- Published
- 2017
- Full Text
- View/download PDF