Conjecture on the proper open conflict-free chromatic index
Conjecture on the proper open conflict-free chromatic index
Let be a graph with maximum degree , and let denote its proper open conflict-free chromatic index.
Proper open conflict-free chromatic-index conjecture. For every graph with maximum degree ,
The conjecture aims to improve the currently available general upper bound, which is slightly above , to within an absolute constant of the trivial lower bound .
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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.