The -graph modular chromatic-index conjecture
Let be a positive integer. A -graph is the graph class defined in the source, and is the mod chromatic index. -graph conjecture. For every -graph ,
The source presents this as a second proposed route to improving the multiplicative constants in the main theorem. The supplied context does not state a resolution or the precise definition of and the associated graph class.
References
Primary source
Gaétan Berthe, Marthe Bonamy, Fábio Botler, Gaia Carenini, Lucas Colucci, Arthur Dumas, Fatemeh Ghasemi and Pedro Mariano Viana Neto, “On Modular Edge Colourings of Graphs”, arXiv:2507.04254 (2025).
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.