The Linear Arboricity Conjecture for Graphs with Large Girth

Tapas Kumar Mishra

The Linear Arboricity Conjecture asserts that the linear arboricity of a graph with maximum degree $\Delta$ is $\lceil (\Delta +1)/2\rceil$. For a $2k$-regular graph $G$, this implies $la(G)…