Abstrakt
We prove that every 3-edge-connected graph G has a 3-flow phi with the property that |supp(phi)| >= 5/6 |E(G)|. The graph K_4 demonstrates that this 5/6 ratio is best possible; there is an infinite family where 5/6 is tight.
We prove that every 3-edge-connected graph G has a 3-flow phi with the property that |supp(phi)| >= 5/6 |E(G)|. The graph K_4 demonstrates that this 5/6 ratio is best possible; there is an infinite family where 5/6 is tight.