Publication details
A note on antisymmetric flows in graphs
| Authors | |
|---|---|
| Year of publication | 2010 |
| Type | Article in Periodical |
| Magazine / Source | European Journal of Combinatorics |
| Citation | |
| Doi | http://dx.doi.org/10.1016/j.ejc.2009.05.005 |
| Description | We prove that any orientation of a graph without bridges and directed 2-edge-cuts admits a Z(2)(3) x Z(3)(9)-antisymmetric flow, which improves the bounds obtained by DeVos, Johnson and Seymour, and DeVos, Nesetril and Raspaud. (C) 2009 Elsevier Ltd. All rights reserved. |