FoCM 2014 conference

Workshop A4 - Graph Theory and Combinatorics

December 11, 15:00 ~ 15:30 - Room B11

## On the directed cycle double cover conjecture

### University of São Paulo, Brazil   -   apjr.andrea@gmail.com

Given a graph $G$, let $D(G)$ denote the direct graph obtained from $G$ by replacing each edge of $G$ by a pair of arcs oppositely directed. The famous directed cycle double cover conjecture, formulated by Jaeger, asserts that if $G$ is a graph without bridges, then the set of arcs of $D(G)$ can be partitioned into directed cycles. In this talk we discuss our recent progress towards a proof of Jaeger's conjecture.

Joint work with Martin Loebl (Charles University, Czech Republic).