Havet–van den Heuvel–McDiarmid–Reed conjecture for nice graph classes
Havet–van den Heuvel–McDiarmid–Reed conjecture for nice graph classes
A graph class is nice if it is minor-closed and does not contain for some positive integer . Havet–van den Heuvel–McDiarmid–Reed conjecture. There exists such that, whenever and ,
This asymptotic strengthening is posed for all nice classes; the survey gives asymptotic results for list coloring but does not report a resolution of this sharper bound.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Daniel W. Cranston, “Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)”, arXiv:2210.05915 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.