Decomposing edge-coloured complete symmetric digraphs into monochromatic paths

Abstract

Confirming and extending a conjecture by Guggiari, we show that every countable $(r+1)$-edge-coloured complete symmetric digraph containing no directed paths of edge-length ${\ell }_i$ for any colour $i\le r$ can be covered by ${\prod }_{i\le r}{\ell }_i$ pairwise disjoint monochromatic directed paths in colour $r+1$.

8 pages

References in corpus (1)

• Monochromatic Paths in the Complete Symmetric Infinite Digraph