{"paper":{"title":"Deterministic Distributed Edge-Coloring with Fewer Colors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Fabian Kuhn, Jara Uitto, Mohsen Ghaffari, Yannic Maus","submitted_at":"2017-11-15T09:22:14Z","abstract_excerpt":"We present a deterministic distributed algorithm, in the LOCAL model, that computes a $(1+o(1))\\Delta$-edge-coloring in polylogarithmic-time, so long as the maximum degree $\\Delta=\\tilde{\\Omega}(\\log n)$. For smaller $\\Delta$, we give a polylogarithmic-time $3\\Delta/2$-edge-coloring. These are the first deterministic algorithms to go below the natural barrier of $2\\Delta-1$ colors, and they improve significantly on the recent polylogarithmic-time $(2\\Delta-1)(1+o(1))$-edge-coloring of Ghaffari and Su [SODA'17] and the $(2\\Delta-1)$-edge-coloring of Fischer, Ghaffari, and Kuhn [FOCS'17], positi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05469","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"}