Metraipolis › archive › dc_f43e4fbf1dd0
A stronger upper bound on the D-chromatic index — arXiv:2609.01875
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.01875
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T05:32:53.045Z
- SHA-256 of the archived text
5ef5c6767f6360d032b4631b134962427c5fd936900a1509aba238b184b1a5bb- Stable URL of this page
https://metraipolis.com/documento/dc_f43e4fbf1dd0
How to cite
A stronger upper bound on the D-chromatic index — arXiv:2609.01875 — arXiv (en), https://arxiv.org/abs/2609.01875 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f43e4fbf1dd0 (Metraipolis archive dc_f43e4fbf1dd0, sha256 5ef5c6767f6360d032b4631b134962427c5fd936900a1509aba238b184b1a5bb)
BibTeX
@misc{dcf43e4fbf1dd0,
title = {A stronger upper bound on the D-chromatic index — arXiv:2609.01875},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.01875},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f43e4fbf1dd0; sha256 5ef5c6767f6360d032b4631b134962427c5fd936900a1509aba238b184b1a5bb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.01875. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For a graph $G$, a proper edge coloring of $G$ is called a D-coloring if every diamond subgraph of $G$ is rainbow. Let $\chi'_D(G)$ be the D-chromatic index of $G$, which is the smallest integer $k$ such that $G$ admits a D-coloring with $k$ colors. Let $\Delta$ be the maximum degree of $G$. The only known Brooks-type upper bound on $\chi'_D(G)$ is $\frac{9}{16}\Delta^2 + \frac{1}{2}\Delta$, given by a greedy coloring. In this paper, using a probabilistic method, we obtain the first improvement upon this upper bound by proving that $\chi'_D(G) \le (1-c)\frac{9}{16}\Delta^2$ for some $c > 0$ and sufficiently large $\Delta$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.01875 — 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-17T04:59:51.760Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).