Answers are grounded in this paper and cite their sources.
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 χ'ₛ(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 $Δ$, χ'ₛ(G)≤ 1.642Δ², improving the previous best bound 1.73Δ² due to Davey, Hurley, de Joannis de Verclos, Kang, and Volec.
No takes yet. Share an insight, caveat, or question.
Runze Wang (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: