An improved bound on the strong chromatic index via local flag algebras
A strong edge coloring is an edge coloring where two edges receive different colors if they are incident or joined by a third edge. For a graph $G$, the strong chromatic index of $G$, denoted by $χ'_s(G)$, is the minimum number of colors needed for a strong edge coloring of $G$. In this paper, using a local flag algebra method, we prove that for every graph $G$ of sufficiently large maximum degree $Δ$, $χ'_s(G)\le 1.642Δ^2$, improving the previous best bound $1.73Δ^2$ due to Davey, Hurley, de Joannis de Verclos, Kang, and Volec.
Authors
- Runze Wang
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-17
- DOI
- https://doi.org/10.48550/arxiv.2611.22031
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- preprint