On factorizations of directed graphs by cycles ‡ Gyula Pap ? and László Szegő ? ?

@inproceedings{Pap2004OnFO,
  title={On factorizations of directed graphs by cycles ‡ Gyula Pap ? and L{\'a}szl{\'o} Szegő ? ?},
  author={Gyula Pap and L{\'a}szl{\'o} Szegő},
  year={2004}
}
In this paper we present a min-max theorem for a factorization problem in directed graphs. This extends the Berge-Tutte formula on matchings as well as formulas for the maximum even factor in weakly symmetric directed graphs and a factorization problem in undirected graphs. We also prove an extension to the structural theorem of Gallai and Edmonds about a canonical set attaining minimum in the formula. The matching matroid can be generalized to this context: we get a matroidal description of… CONTINUE READING