Linear arboricity conjecture

Prove that every graph with maximum degree Δ can be decomposed into at most ⌈(Δ + 1)/2⌉ path forests.

Background

The linear arboricity conjecture asks for the minimum number of path forests needed to decompose the edges of a graph in terms of its maximum degree. The conjectured bound is the natural analogue of classical arboricity-type decomposition results.

The paper presents this as a prominent unresolved problem related to vertex coverings by disjoint paths, but does not address or resolve it.

References

Perhaps the most famous open problem in this area is the linear arboricity conjecture of Akiyama, Exoo, and Harary from 1980, which states that every graph with maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta + 1)/2\rceil$ path forests.

— Nearly Hamilton cycles in sublinear expanders, and applications  (2503.07147 - Letzter et al., 10 Mar 2025) in Section 1, subsection “Packing subgraphs in regular graphs”

Perhaps the most famous open problem in this area is the linear arboricity conjecture of Akiyama, Exoo, and Harary from 1980, which states that every graph with maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta + 1)/2\rceil$ path forests.

— Nearly Hamilton cycles in sublinear expanders, and applications  (2503.07147 - Letzter et al., 10 Mar 2025) in Section 1, subsection “Packing subgraphs in regular graphs”

Perhaps the most famous open problem in this area is the linear arboricity conjecture of Akiyama, Exoo, and Harary from 1980, which states that every graph with maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta + 1)/2\rceil$ path forests.

— Nearly Hamilton cycles in sublinear expanders, and applications  (2503.07147 - Letzter et al., 10 Mar 2025) in Section 1, subsection “Packing subgraphs in regular graphs”

Akiyama, Exoo and Harary conjectured that these lower bounds are best possible.

— Linear arboricity conjecture for infinite graphs  (2610.02065 - Aurichi et al., 1 Oct 2026) in Introduction, Conjecture 1.1

To the best of our knowledge, however, linear arboricity had not previously been considered for infinite graphs. We propose the following extension.

— Linear arboricity conjecture for infinite graphs  (2610.02065 - Aurichi et al., 1 Oct 2026) in Introduction, Conjecture 1.2

We conclude with two questions suggested by the results of this paper. The first concerns the optimal general upper bound for topological linear arboricity.

— Linear arboricity conjecture for infinite graphs  (2610.02065 - Aurichi et al., 1 Oct 2026) in Section 3, Question 3.1

There is, however, no reason for the two forests obtained in such a decomposition to be isomorphic. This suggests asking whether the decomposition can be chosen with this additional symmetry.

— Linear arboricity conjecture for infinite graphs  (2610.02065 - Aurichi et al., 1 Oct 2026) in Section 3, immediately following Question 3.1