A note on antisymmetric flows in graphs

Zdenek Dvorak (1) , Tomas Kaiser (2) , Daniel Král' (3) , Jean-Sébastien Sereni (1, 4)

1 KAM - Department of Applied Mathematics (KAM)
2 KMA - Katedra Matematiky - University of West Bohemia
3 ITI - Institut teoretické informatiky
4 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a (Z3^2 × Z9^3)-antisymmetric flow, which improves the bounds obtained by DeVos, Johnson and Seymour, and DeVos, Nesetril and Raspaud.

Mots clés: nowhere-zero flow; antisymmetric flow

Domaines: Mathématique discrète [cs.DM]

Zdenek Dvorak, Tomas Kaiser, Daniel Král', Jean-Sébastien Sereni. A note on antisymmetric flows in graphs. European Journal of Combinatorics, 2010, 31 (1), pp.320--324. ⟨10.1016/j.ejc.2009.05.005⟩. ⟨hal-00487098⟩