---
title: Weak 3-Flow Conjecture in Graph Theory
url: https://www.emergentmind.com/topics/weak-3-flow-conjecture
type: topic
---

# Weak 3-Flow Conjecture in Graph Theory

Searching arXiv for recent and foundational papers on the Weak 3-Flow Conjecture and closely related notions.
{"queries":[{"query":"\"weak 3-flow conjecture\" graph theory arXiv","preferred_count":10},{"query":"Tutte 3-flow conjecture Z3-connectivity arXiv","preferred_count":10}]}
The Weak 3-Flow Conjecture belongs to nowhere-zero flow theory and asks whether sufficiently strong edge-connectivity forces the existence of a nowhere-zero $3$-flow. The term is not uniform in the literature. In Jaeger’s 1979 sense, it asks whether there exists an integer $h$ such that every $h$-edge-connected graph admits a nowhere-zero $3$-flow. In Kochol’s formulation, it asks whether every $5$-edge-connected graph admits a nowhere-zero $3$-flow, a statement that is equivalent to Tutte’s $3$-flow conjecture that every $4$-edge-connected graph admits such a flow. Closely related formulations use modulo-$3$ orientations and $\mathbb{Z}_3$-connectivity, and much of the modern theory moves between these equivalent or stronger perspectives [1406.1554][2005.00297].

## 1. Definitions and basic equivalences

Let $G$ be a finite loopless graph, possibly with multiple edges, and let $D$ be an orientation of $G$. A nowhere-zero $3$-flow on $D$ is a mapping
$$
f:E(D)\to \{1,2\}
$$
such that for every vertex $v$,
$$
\sum_{e\in \delta^+(v)} f(e)\equiv \sum_{e\in \delta^-(v)} f(e)\pmod{3}.
$$
Equivalently, one may use the integral formulation with values in $\{\pm 1,\pm 2\}$ and exact conservation at each vertex. A modulo $3$-orientation is an orientation $D$ satisfying
$$
d_D^+(v)-d_D^-(v)\equiv 0\pmod{3}
$$
for all vertices $v$. By Tutte’s characterization, a graph has a nowhere-zero $3$-flow if and only if it has a modulo $3$-orientation [1406.1554].

A graph is $k$-edge-connected if every edge-cut has size at least $k$, and it is bridgeless if it has no $1$-edge-cut. For a vertex set $X\subseteq V(G)$, the associated cut is
$$
\delta_G(X)=\{uv\in E(G):u\in X,\ v\notin X\}.
$$
A $k$-edge-cut is a cut of size $k$ [1406.1554].

The stronger notion of $\mathbb{Z}_3$-connectivity is defined through arbitrary boundary functions. If $b:V(G)\to \mathbb{Z}_3$ satisfies
$$
\sum_{v\in V(G)} b(v)\equiv 0\pmod{3},
$$
then $G$ is $\mathbb{Z}_3$-connected if there exist an orientation $D$ and a function
$$
f:E(D)\to \mathbb{Z}_3\setminus\{0\}
$$
such that for every vertex $v$,
$$
\sum_{e\in \delta^+(v)} f(e)-\sum_{e\in \delta^-(v)} f(e)\equiv b(v)\pmod{3}.
$$
Taking $b\equiv 0$ yields a modulo $3$-orientation, so $\mathbb{Z}_3$-connectivity implies the existence of a nowhere-zero $3$-flow [1406.1554].

## 2. Formulations and logical structure

The central difficulty of the subject is not the existence of some connectivity threshold, but the determination of the sharp threshold and the precise role of group-connectivity. The literature uses “Weak 3-Flow Conjecture” in more than one sense. In the standard Jaeger usage, it is the existence of a fixed threshold $h$. In Kochol’s usage, or in papers that identify the weak problem with Tutte’s conjecture, the phrase may instead refer to the $5$-edge-connected or even $4$-edge-connected statement. This terminological instability is explicit in the literature: some later papers refer to Tutte’s $3$-flow conjecture itself as the weak $3$-flow conjecture [1406.1554][2008.07152][2510.01300].

| Formulation | Meaning | Relation/status |
|---|---|---|
| Tutte’s $3$-flow conjecture | Every $4$-edge-connected graph has a nowhere-zero $3$-flow | Open |
| Jaeger’s weak form | There exists $h$ such that every $h$-edge-connected graph has a nowhere-zero $3$-flow | Settled with $h=6$ |
| Kochol’s $5$-edge-connected form | Every $5$-edge-connected graph has a nowhere-zero $3$-flow | Equivalent to Tutte’s conjecture |
| JLPT conjecture | Every $5$-edge-connected graph is $\mathbb{Z}_3$-connected | Implies Kochol’s form |

Thomassen proved that every $8$-edge-connected graph is $\mathbb{Z}_3$-connected, and Lovász, Thomassen, Wu, and Zhang improved this to $6$-edge-connected graphs. Consequently, Jaeger’s existence-of-$h$ conjecture is resolved with $h=6$, but this does not settle either the JLPT $5$-edge-connected $\mathbb{Z}_3$-connectivity conjecture or Kochol’s equivalent $5$-edge-connected version of Tutte’s conjecture [1406.1554][1611.02231].

Kochol also proved that Tutte’s $3$-flow conjecture is equivalent to the statement that every bridgeless graph with at most three $3$-edge-cuts admits a nowhere-zero $3$-flow. This recasts the conjecture as a statement about controlling the smallest odd cuts rather than simply increasing global connectivity [1406.1554].

## 3. Progress near the $5$-edge-connected frontier

A major line of progress has been to verify the conjectural conclusions under restrictions on the number of small cuts. Chen and Ning proved that every $4$-edge-connected graph with at most seven $5$-edge-cuts admits a nowhere-zero $3$-flow, that every bridgeless graph containing no $5$-edge-cuts but at most three $3$-edge-cuts admits a nowhere-zero $3$-flow, and that every $5$-edge-connected graph with at most five $5$-edge-cuts is $\mathbb{Z}_3$-connected. Their unifying structural statement is that if $P$ is the set of $3$-edge-cuts and $Q$ the set of $5$-edge-cuts, then
$$
2|P|+|Q|\le 7
$$
implies the existence of a modulo $3$-orientation. The bound “at most three $3$-edge-cuts” is sharp in the second theorem because $K_4$, and more generally graphs contractible to $K_4$, provide the obstruction at four $3$-cuts [1406.1554].

The proof strategy in this small-cut regime is technically centered on pre-orientation extension. The decisive tool is the Lovász–Thomassen–Wu–Zhang extension lemma, which starts with a prescribed orientation at one distinguished vertex and extends it to a global $\mathbb{Z}_3$-boundary orientation under cut inequalities of the form
$$
d_G(A)\ge 4+|T_G(A)|.
$$
Chen and Ning combine minimal counterexamples, contractions of small-cut sides, and an auxiliary-vertex augmentation that controls the number of degree-$3$ and degree-$5$ vertices. Their analysis makes explicit why bounding the number of $5$-edge-cuts is decisive: too many $5$-cuts obstruct the universal cut inequalities required by the extension lemma [1406.1554].

A different structural sufficient condition is the existence of four edge-disjoint spanning trees. Han, Lai, and Li proved that every graph with at least four edge-disjoint spanning trees is $\mathbb{Z}_3$-connected. They also proved that every $5$-edge-connected essentially $23$-edge-connected graph is $\langle\mathbb{Z}_3\rangle$-extendable at any degree-five vertex. Their paper isolates a sharper conjectural threshold: if every $5$-edge-connected essentially $6$-edge-connected graph were $\langle\mathbb{Z}_3\rangle$-extendable at a degree-five vertex, then Jaeger–Linial–Payan–Tarsi would follow [1610.04581].

Hasanvand showed that, conditional on the JLPT conjecture, every $3$-tree-connected graph is $\mathbb{Z}_3$-connected. Unconditionally, the same circle of ideas already gives that every $4$-tree-connected graph is $\mathbb{Z}_3$-connected, and the conditional result extends the conjectural scope from edge-connectivity to spanning-tree packings. The threshold is sharp in the sense that $K_4$ is $2$-tree-connected but has no nowhere-zero $3$-flow [1611.02231].

Flow-extension methods also yield near-planar progress. Li proved that the $3$-flow conjecture is equivalent to the statement that every $5$-edge-connected graph is $M_3$-extendable at every $5$-vertex, and that the $\mathbb{Z}_3$-group-connectivity conjecture is equivalent to $Z_3$-extendability at every $5$-vertex. The same paper verified $\mathbb{Z}_3$-connectivity for $5$-edge-connected graphs with crossing number at most one, and provided small-cut results including that every $4$-edge-connected graph with at most five $4$-cuts and no $5$-cuts is $\mathbb{Z}_3$-connected, and that every $5$-edge-connected graph with at most seven $5$-cuts is $\mathbb{Z}_3$-connected [2005.00297].

## 4. Verified subclasses beyond generic connectivity

Symmetry provides one route below the general $6$-edge threshold. Li and Zhou proved that every regular graph of valency at least four admitting a solvable arc-transitive group of automorphisms admits a nowhere-zero $3$-flow. In the vertex-transitive setting, Watkins’ theorem implies that a graph of valency $d$ is $d$-edge-connected, so the generic $6$-edge-connected theorem already covers valencies at least $6$, and even valency $4$ is handled by nowhere-zero $2$-flows. The valency-$5$ case is therefore the pivotal open instance within highly symmetric graphs, and the solvable arc-transitive theorem settles that case for a broad family by inductive use of normal quotients and multicover lifting [1310.5317].

Another route is to constrain the independence number. A 2017 paper characterized graphs with independence number at most $4$ that admit a nowhere-zero $3$-flow, using two finite exceptional families $F_1$ and $F_2$. As a consequence, every $4$-edge-connected graph of order at least $21$ with $\alpha(G)\le 4$ admits a nowhere-zero $3$-flow. The same work proved that every odd-$5$-edge-connected graph with $\alpha(G)\le 3$ admits a nowhere-zero $3$-flow, thereby strengthening the $4$-edge-connected statement in that class. A new reduction method for odd wheels, based on controlled wheel contractions that preserve the relevant connectivity, is central to the proofs [1707.06745].

Cayley graphs form a third major verified family. In 2026, Ahanjideh and Kovács proved that every connected Cayley graph of valency at least $4$ on a solvable group of order $2n$, where $n$ is square-free, admits a nowhere-zero $3$-flow. The difficult case is valency $5$, where they introduced a necessary and sufficient criterion for a simple $5$-valent graph to admit a nowhere-zero $\mathbb{Z}_3$-flow: the vertex set must admit a partition into nonempty subsets $U$ and $W$ such that the induced subgraphs $[U]$ and $[W]$ are pseudoforests and either all components are unicyclic or suitable transversals in $[U]$ and $[W]$ are joined by a perfect matching. This yields a complete structural criterion for the $5$-regular case within that framework [2603.24175].

## 5. Reformulations, approximations, and alternative proof paradigms

One influential reformulation replaces nowhere-zero flows by flows with a small null set. For an abelian-group flow $\phi$, the nullity is
$$
N(\phi)=\{e\in E(G):\phi(e)=0\}.
$$
Esperet, de Verclos, Le, and Thomassé proved that Tutte’s $3$-flow conjecture is equivalent to the existence of a sublinear function $f$ such that every $4$-edge-connected graph admits a $\mathbb{Z}_3$-flow $\phi$ with
$$
|N(\phi)|\le f(|E(G)|).
$$
Thus an approximate result with $o(|E|)$ zero-edges is exactly as strong as a true nowhere-zero theorem. The same paper gave analogous equivalences for Tutte’s $4$- and $5$-flow conjectures, placing the weak $3$-flow problem inside a broader approximation program for Tutte-type flow conjectures [2008.07152].

A second reformulation is local extension at a single vertex. Li showed that Tutte’s $3$-flow conjecture is equivalent to the statement that every $5$-edge-connected graph is $M_3$-extendable at every $5$-vertex, and that the $\mathbb{Z}_3$-group-connectivity conjecture is equivalent to $Z_3$-extendability at every $5$-vertex. These equivalences use a six-vertex gadget $W$ together with deficiency counting and Mader-type splitting lemmas. They recast a global existence problem as a constrained pre-orientation extension problem, aligning the conjecture with the extension machinery developed by Thomassen and by Lovász–Thomassen–Wu–Zhang [2005.00297].

A third reformulation is algebraic. A 2025 paper on the Additive Basis Conjecture proved that in a vector space over $\mathbb{Z}_3$, the union of any four linear bases is an additive basis, establishing the $p=3$ case with $c(3)=4$. The paper explicitly presents this as an alternative algebraic proof of what it calls the weak $3$-flow conjecture, namely the statement that every $4$-edge-connected graph has a nowhere-zero $3$-flow. Its route passes through the Jaeger–Linial–Payan–Tarsi additive-basis scheme and the cycle space over $\mathbb{F}_3$ [2510.01300].

Taken together, these reformulations show that the weak $3$-flow problem is simultaneously a cut-structure problem, an extension problem, an approximation problem, and an algebraic basis problem. This suggests that the conjecture is less a single isolated assertion than a convergence point for several different theories of graph constraints and group-valued circulations.

## 6. Critical obstructions and current status

Minimal obstructions are encoded by $3$-flow-critical graphs. A bridgeless graph $G$ is $3$-flow-critical if it has no nowhere-zero $3$-flow but every contraction $G/e$ does. Kochol’s equivalence implies that Tutte’s $3$-flow conjecture is equivalent to the assertion that every $3$-flow-critical graph contains a vertex of degree three. Li, Luo, Ma, and Zhang proved several structural constraints on such graphs: they are $3$-edge-connected, essentially $4$-edge-connected, and $\mathbb{Z}_3$-reduced, and the subgraph induced by degree-$3$ vertices contains no cycle unless the graph is an odd wheel. They also established density bounds
$$
\frac{8n-2}{5}\le |E(G)|\le 4n-10
$$
for an $n$-vertex $3$-flow-critical graph, with equality in either direction if and only if $G\cong K_4$, and conjectured the sharper upper bound $|E(G)|\le 3n-8$ for $n\ge 7$ [2003.09162].

The lower-density side was sharpened in 2024. A paper on the sparsity of $3$-flow-critical graphs proved that every $n$-vertex $3$-flow-critical graph other than $K_2$ and $K_4$ has at least
$$
\frac{5n}{3}
$$
edges, and that this is tight up to lower-order terms. The proof uses a linear-algebraic independence argument over $\mathbb{Z}_3$ and generalizes Koester’s planar result on the maximum average degree of $4$-critical planar graphs. The same work derives an algorithmic corollary: for a connected graph with at most $(5/3)n+k$ edges, one can in time $\operatorname{poly}(n)+O(k\cdot 8^k\cdot n)$ either find a nowhere-zero $3$-flow, certify nonexistence, or identify an edge whose contraction preserves flow existence [2404.00324].

The present status is therefore sharply bifurcated. The existence-of-a-threshold version of the Weak 3-Flow Conjecture is settled: every $6$-edge-connected graph is $\mathbb{Z}_3$-connected and hence has a nowhere-zero $3$-flow. By contrast, the full $5$-edge-connected case remains open, both in the stronger JLPT form “every $5$-edge-connected graph is $\mathbb{Z}_3$-connected” and in Kochol’s equivalent $5$-edge-connected nowhere-zero-$3$-flow form, and therefore Tutte’s $4$-edge-connected conjecture remains open as well. The verified subclasses and partial theorems strongly support the view that small cuts, especially of sizes $3$, $4$, and $5$, are the principal obstructions, but the general transition from $6$- to $5$-edge-connectivity is still unresolved [1406.1554].

Source: https://www.emergentmind.com/topics/weak-3-flow-conjecture