A new proof of Seymour's 6-flow theorem
Combinatorics
2015-12-22 v1
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.
Keywords
Cite
@article{arxiv.1512.06214,
title = {A new proof of Seymour's 6-flow theorem},
author = {Matt DeVos and Edita Rollová and Robert Šámal},
journal= {arXiv preprint arXiv:1512.06214},
year = {2015}
}
Comments
8 pages, 1 figure