Smallest counterexample to the 5-flow conjecture has girth at least eleven (Q974466)

A graph admits a nowhere-zero k-flow if its edges can be oriented and assigned numbers so that for every vertex, the sum of the values on incoming edges equals the sum on the outgoing ones. The famous 5-flow conjecture of Tutte is that every bridgeless graph has a nowhere-zero 5-flow. The paper shows that a smallest counterexample to this conjecture must have girth at least 11.