A new proof of Seymour's 6-flow theorem

详细信息    查看全文

• 作者：Matt DeVos^a ; ¹ ; ^{mdevos@sfu.ca} ; Edita Rollová ; ^b ; ² ; ^{rollova@ntis.zcu.cz} ; Robert &Scaron ; á ; mal^c ; ³ ; ^{samal@iuuk.mff.cuni.cz}
• 关键词：Nowhere-zero flow ; 6-flow
• 刊名：Journal of Combinatorial Theory, Series B
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：122
• 期：Complete
• 页码：187-195
• 全文大小：289 K
• 卷排序：122

文摘

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.