The large-support 3-flow conjecture for 2-edge-connected graphs

Let $G$ be a graph, and let $E(G)$ denote its edge set. A 3-flow on $G$ is a flow whose values lie in a group of order three, and its support is the set of edges on which the flow is nonzero. Large-support 3-flow conjecture. Every 2-edge-connected graph $G$ has a 3-flow $\phi$ satisfying

$$|\operatorname{supp}(\phi)| \ge \tfrac{5}{6}|E(G)|.$$

The paper presents this as a proposed extension of its methods beyond 3-edge-connected graphs; its status is not resolved in the supplied text.