Metraipolis › archive › dc_d4552dc09f23

Fast Distributed $(Δ+ 1)$-Edge Coloring in Bipartite Graphs — arXiv:2610.22690

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.22690
License (as archived)
CC0-1.0
Archived
2026-10-19T08:44:11.314Z
SHA-256 of the archived text
4e5be18877720ba8cd3c4adaf1f1b60363cdf154321e8c856e5c033bb7950bb0
Stable URL of this page
https://metraipolis.com/documento/dc_d4552dc09f23

How to cite

Fast Distributed $(Δ+ 1)$-Edge Coloring in Bipartite Graphs — arXiv:2610.22690 — arXiv (en), https://arxiv.org/abs/2610.22690 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d4552dc09f23 (Metraipolis archive dc_d4552dc09f23, sha256 4e5be18877720ba8cd3c4adaf1f1b60363cdf154321e8c856e5c033bb7950bb0)
BibTeX
@misc{dcd4552dc09f23,
  title = {Fast Distributed $(Δ+ 1)$-Edge Coloring in Bipartite Graphs — arXiv:2610.22690},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.22690},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d4552dc09f23; sha256 4e5be18877720ba8cd3c4adaf1f1b60363cdf154321e8c856e5c033bb7950bb0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22690. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We show that, on bipartite $n$-vertex graphs in the LOCAL model of distributed computation, $(\Delta + 1)$-edge coloring can be solved deterministically in $O(f(\Delta) \log n)$ rounds for some function $f$. In particular this implies a deterministic $O(\log n)$-round upper bound for $(\Delta + 1)$-edge coloring on bipartite constant-degree graphs. Our results improve on the previous state-of-the-art bounds (which hold already on general graphs) whose $n$-dependencies are $\widetilde{O}(\log^5 n)$ rounds deterministically and $\widetilde{O}(\log^2 n)$ rounds randomized [Bernshteyn and Dhawan, J.\ Comb.\ Theory 2025]. In fact, we obtain the aforementioned results already for a more restrictive version of $(\Delta + 1)$-edge coloring that corresponds to a \emph{local-palette} strengthening of Vizing's theorem shown recently to hold [Christiansen, STOC 2023]. In this version, every edge $\{u, v\}$ has to be colored with a color from $\{1, \dots, \max(\operatorname{deg}(u), \operatorname{deg}(v))+ 1\}$. For all of our results, the vertices do not need to know on which side of the bipartition they lie---the structural promise of bipartiteness suffices.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.22690 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T08:39:39.738Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).