A note on antisymmetric flows in graphs

We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z23×Z39-antisymmetric flow, which improves the bounds obtained by DeVos, Johnson and Seymour, and DeVos, Nešetřil and Raspaud.