An–Wu list linear arboricity conjecture

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

$$\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.