Conjecture on the proper open conflict-free chromatic index

Let GG be a graph with maximum degree Δ\Delta, and let χpOCF(G)\chi_{\rm pOCF}'(G) denote its proper open conflict-free chromatic index.

Proper open conflict-free chromatic-index conjecture. For every graph GG with maximum degree Δ\Delta,

χpOCF(G)Δ+3.\chi_{\rm pOCF}'(G)\leq \Delta+3.

The conjecture aims to improve the currently available general upper bound, which is slightly above 2Δ2\Delta, to within an absolute constant of the trivial lower bound Δ\Delta.

Sources & referencesView supporting material

Primary source

Mateusz Kamyczura and Jakub Przybyło, “On asymptotically tight bounds for the open conflict-free chromatic indexes of nearly regular graphs”, arXiv:2601.17827 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.