List Linear Hadwiger's conjecture
Let be the complete graph on vertices, and call a graph -minor-free if it has no minor. A list assignment assigns a set of permissible colours to each vertex ; a graph is -choosable if it has a proper -colouring for every list assignment with . List Linear Hadwiger's conjecture. There exists a constant such that for every integer , every -minor-free graph is -choosable. The ordinary list version of Hadwiger's conjecture is false, but this linear list version remains open.
References
2 papers in this index state this conjecture (2022). The statement above is taken from the most recent of them; the others are arXiv:2203.06718.
Source: Yangyan Gu, Yiting Jiang, David R. Wood and Xuding Zhu, “Refined list version of Hadwiger's conjecture”, arXiv:2209.07013 (2022).
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
No solutions have been posted yet.