Informace o publikaci
A note on antisymmetric flows in graphs
| Autoři | |
|---|---|
| Rok publikování | 2010 |
| Druh | Článek v odborném periodiku |
| Časopis / Zdroj | European Journal of Combinatorics |
| Citace | |
| Doi | http://dx.doi.org/10.1016/j.ejc.2009.05.005 |
| Popis | 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. |