Linear arboricity conjecture
Prove that every graph with maximum degree Δ can be decomposed into at most ⌈(Δ + 1)/2⌉ path forests.
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.
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.
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.
Akiyama, Exoo and Harary conjectured that these lower bounds are best possible.
To the best of our knowledge, however, linear arboricity had not previously been considered for infinite graphs. We propose the following extension.
We conclude with two questions suggested by the results of this paper. The first concerns the optimal general upper bound for topological linear arboricity.
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.