A note on antisymmetric flows in graphs
Résumé
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.
Domaines
Mathématique discrète [cs.DM]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...