Another proof of Seymour's 6-flow theorem

DOI10.1002/JGT.23091MaRDI QIDQ6565818zbMATH OpenFDO

Authors Matt DeVos, Jessica McDonald, Kathryn Nurse

Publication date 2 July 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1002/JGT.23091

zbMATH Keywords

6-flow theoremgroup-valued flownowhere-zero flow

Mathematics Subject Classification ID

Flows in graphs (05C21)

Review text

One of the longstanding conjectures of Tutte states that every 2-edge-connected graph has a nowhere zero 5-flow. \textit{P. D. Seymour} [J. Comb. Theory, Ser. B 30, 130--135 (1981; Zbl 0474.05028)] proved his famous 6-flow theorem asserting that every 2-edge-connected graph has a nowhere-zero 6-flow, utilizing a nowhere-zero flow valued in the group \({\mathbb Z}_2 \times {\mathbb Z}_3\). A new short proof of a generalization of this theorem, where \({\mathbb Z}_2 \times {\mathbb Z}_3\)-valued functions are found subject to certain boundary constraints.

Recommendations

• A new proof of Seymour's 6-flow theorem
• Nowhere-zero 6-flows: a linear algebraic approach
• Extensions of flow theorems
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero flows in low genus graphs

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Nowhere-zero 6-flows

Cited in

(1)

• A short proof of Seymour's 6-flow theorem

This page was built for publication: Another proof of Seymour's 6-flow theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565818)