A new proof of Seymour's 6-flow theorem

2015/12/19 by DeVos, Matt, Rollová, Edita, Šámal, Robert
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1512.06214

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.

Related

• A short proof of Seymour's 6-flow theorem
• Another proof of Seymour's 6-flow theorem
• Nowhere-zero 5-flows on cubic graphs with oddness 4
• Flows on Bidirected Graphs
• Nowhere-zero 5-flow on signed ladders