3-Flows with Large Support

Matt DeVos, Jessica McDonald, Irene Pivotto +2

We prove that every 3-edge-connected graph $G$ has a 3-flow $\varphi$ with the property that $|\mathrm{supp}(\varphi )|\ge \frac{5}{6}|E(G)|$. The graph $K_4$ demonstrates that this $\frac{5}…