← All problems

List Linear Hadwiger's conjecture

4 years old · traced to

Let KtK_t be the complete graph on tt vertices, and call a graph KtK_t-minor-free if it has no KtK_t minor. A list assignment LL assigns a set of permissible colours L(v)L(v) to each vertex vv; a graph is kk-choosable if it has a proper LL-colouring for every list assignment with ∣L(v)∣⩾k|L(v)|\geqslant k. List Linear Hadwiger's conjecture. There exists a constant C>0C>0 such that for every integer t⩾1t\geqslant1, every KtK_t-minor-free graph is CtCt-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

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.