← All problems

Class 1 conjecture for K5K_5-minor free graphs of maximum degree six

6 years old · traced to

Let GG be a K5K_5-minor free graph with maximum degree Δ=6\Delta=6.

Edge-coloring conjecture. Then GG is class 11.

This conjecture extends the paper's result that every K5K_5-minor free graph with maximum degree at least 77 is class 11, and asks whether the analogous conclusion holds at maximum degree six.

References
  1. Jieru Feng, Yuping Gao and Jianliang Wu, “The edge colorings of K_5-minor free graphs”, arXiv:2002.10109 (2020).

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.