← All problems

An–Wu list linear arboricity conjecture

11 years old · traced to

Let GG be an undirected graph with maximum degree Δ\Delta, let la(G)la(G) be its linear arboricity, and let lla(G)lla(G) be its list linear arboricity. List Linear Arboricity Conjecture.

⌈Δ2⌉⩽la(G)=lla(G)⩽⌈Δ+12⌉.\left\lceil\frac{\Delta}{2}\right\rceil\leqslant la(G)=lla(G)\leqslant\left\lceil\frac{\Delta+1}{2}\right\rceil.

This combines the ordinary linear arboricity bounds with the assertion that the list and ordinary parameters coincide. The best known result in the paper is asymptotic, so the exact statement remains open.

References

6 papers in this index state this conjecture (2015–2025). The statement above is taken from the most recent of them; the others are arXiv:2409.03233, arXiv:2405.18494, arXiv:1809.04716, arXiv:1712.05006, arXiv:1503.00494.

Source: Yueping Shi and Ping Hu, “The List Linear Arboricity of Digraphs”, arXiv:2512.20195 (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.