Tutte's -Flow Conjecture
Canonical statement
View source LaTeX
Every finite bridgeless loopless multigraph \(G\) admits an
orientation of its edges and a function
\(\varphi:E(G)\to\{1,2,3,4\}\) such that, for every vertex \(v\),
\[
\sum_{e\in\delta^+(v)}\varphi(e)
\equiv
\sum_{e\in\delta^-(v)}\varphi(e)\pmod 5.
\]
Here \(\delta^+(v)\) and \(\delta^-(v)\) are respectively the sets of
edges directed out of and into \(v\).Notes
A nowhere-zero -flow on a graph is an orientation of its edges together with values such that flow is conserved modulo at every vertex. Tutte conjectured in 1954 that every bridgeless graph admits such a flow [Tutte1954Flows]. The conjecture arose from his theory of flows as the dual of coloring: for planar graphs the statement is equivalent, via duality, to the five-color theorem, so it extends a classical coloring fact to all bridgeless graphs.
The nearest universal result is Seymour's theorem that every bridgeless graph has a nowhere-zero -flow [Seymour1981SixFlow]. A standard reduction shows that a minimal counterexample would have to be a snark, and nowhere-zero -flows have been constructed for many classes of graphs; see West's account of the problem [WestTutte5Flow].
Despite this, no proof covers every bridgeless graph, and closing the gap between Seymour's -flow theorem and the conjectured value remains open.
References (3)
- [Tutte1954Flows]
A contribution to the theory of chromatic polynomials
Open ↗W. T. Tutte · 1954 · misc
- [Seymour1981SixFlow]
Nowhere-zero 6-flows
Open ↗Paul D. Seymour · 1981 · misc
- [WestTutte5Flow]
Tutte's 5-flow conjecture
Open ↗Douglas B. West · 2026 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.