| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654190 | European Journal of Combinatorics | 2010 | 5 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Zdeněk Dvořák, Tomáš Kaiser, Daniel Král’, Jean-Sébastien Sereni,