An Improved Bound for the Linear Arboricity Conjecture

In 1980, Akiyama, Exoo and Harary posited the Linear Arboricity Conjecture which states that any graph G of maximum degree Δ can be decomposed into at most linear forests. (A forest is linear if all of its components are paths.) In 1988, Alon proved the conjecture holds asymptotically. The current best bound is due to Ferber, Fox and Jain from 2020 who showed that Δ/2+ O(Δ ^0.661) suffices for large enough Δ . Here, we show that G admits a decomposition into at most Δ/2+ 3√(Δ)log ^4 Δ linear forests provided Δ is large enough. Moreover, our result also holds in the more general list setting, where edges have (possibly different) sets of permissible linear forests. Thus our bound also holds for the List Linear Arboricity Conjecture which was only recently shown to hold asymptotically by Kim and the second author. Indeed, our proof method ties together the Linear Arboricity Conjecture and the well-known List Colouring Conjecture; consequently, our error term for the Linear Arboricity Conjecture matches the best known error-term for the List Colouring Conjecture due to Molloy and Reed from 2000. This follows as we make two copies of every colour and then seek a proper edge colouring where we avoid bicoloured cycles between a colour and its copy; we achieve this via a clever modification of the nibble method.