{"paper":{"title":"Decomposing edge-coloured complete symmetric digraphs into monochromatic paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Carl B\\\"urger, Max Pitz","submitted_at":"2017-11-23T14:36:19Z","abstract_excerpt":"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\\leq r$ can be covered by $\\prod_{i\\leq r} \\ell_i$ pairwise disjoint monochromatic directed paths in colour $r+1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08711","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}