Geodesic
On partitioning the edges of an infinite digraph into directed cycles
Advances in Combinatorics (2021) Cet article a éte moissonné depuis la source Scholastica

Voir la notice de l'article

Nash-Williams proved that for an undirected graph $ G $ the set $ E(G) $ can be partitioned into cycles if and only if every cut has either even or infinite number of edges. Later C. Thomassen gave a simpler proof for this and conjectured the following directed analogue of the theorem: the edge set of a digraph can be partitioned into directed cycles if and only if for each subset of the vertices the cardinality of the ingoing and the outgoing edges are equal. The aim of the paper is to prove this conjecture.
Publié le : 
@article{ADVC_2021_a7,
     author = {Attila Jo\'o},
     title = {On partitioning the edges of an infinite digraph into directed cycles},
     journal = {Advances in Combinatorics},
     year = {2021},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ADVC_2021_a7/}
}
TY  - JOUR
AU  - Attila Joó
TI  - On partitioning the edges of an infinite digraph into directed cycles
JO  - Advances in Combinatorics
PY  - 2021
UR  - http://geodesic.mathdoc.fr/item/ADVC_2021_a7/
LA  - en
ID  - ADVC_2021_a7
ER  - 
%0 Journal Article
%A Attila Joó
%T On partitioning the edges of an infinite digraph into directed cycles
%J Advances in Combinatorics
%D 2021
%U http://geodesic.mathdoc.fr/item/ADVC_2021_a7/
%G en
%F ADVC_2021_a7
Attila Joó. On partitioning the edges of an infinite digraph into directed cycles. Advances in Combinatorics (2021). http://geodesic.mathdoc.fr/item/ADVC_2021_a7/