Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs

Furthermore, we present a stability version for the countable case of the latter result: We prove that the edge-colouring is uniquely determined on a large subgraph, as soon as the upper density of monochromatic paths in colour r+1 is bounded by ∏i∈[r]1ℓi.