Decomposing edge-coloured complete symmetric digraphs into monochromatic paths

2017/11/23 by Carl Bürger, Bürger, Carl, Max Pitz +1 · 1 citation
Computer Science · Mathematics · #05C15 #05C20 #05C35 #05C63 #Advanced Graph Theory Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #math.CO #msc:05C15 #msc:05C20 #msc:05C35 #msc:05C63

paper · pdf · doi:10.48550/arxiv.1711.08711

8 pages

arxiv created 2017/11/23 · openalex publication_date 2017/11/23 · arxiv updated 2017/11/27 · openalex created_date 2022/09/03 · openalex updated_date 2026/07/28

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 ℓ_i for any colour i≤ r can be covered by ∏_{i≤ r} ℓ_i pairwise disjoint monochromatic directed paths in colour r+1.

Cited by

• Partitioning Edge-Coloured Complete Symmetric Digraphs into Monochromatic Complete Subgraphs

Related

• Partitioning Edge-Coloured Complete Symmetric Digraphs into Monochromatic Complete Subgraphs
• Monochromatic Paths in the Complete Symmetric Infinite Digraph
• Partitioning edge-coloured infinite complete bipartite graphs into monochromatic paths
• Partitioning edge-coloured complete graphs into monochromatic cycles and paths
• A proof of a conjecture of Erdős and Gyárfás on monochromatic path covers