Decompositions of edge-colored infinite complete graphs into monochromatic paths

An r-edge coloring of a graph or hypergraph G=(V,E) is a map c:E→{0,…,r−1}. Extending results of Rado and answering questions of Rado, Gyárfás and Sárközy we prove that