Linear Arboricity Conjecture
Canonical statement
View source LaTeX
Let \(\operatorname{la}(G)\) be the least number of linear
forests (forests whose components are paths, including isolated edges)
whose edge sets partition \(E(G)\). Every finite simple graph \(G\) with
maximum degree \(\Delta(G)\) satisfies
\[
\operatorname{la}(G)\leq
\left\lceil\frac{\Delta(G)+1}{2}\right\rceil.
\]Notes
A linear forest is a graph each of whose components is a path, and the linear arboricity is the least number of linear forests whose edge sets partition . A vertex of degree meets each linear forest in at most two edges, so , and for regular graphs one further forest is forced. The conjecture, proposed by Akiyama, Exoo, and Harary around 1980–1981, asserts that always suffices [AkiyamaExooHarary1981].
Alon proved the conjecture asymptotically, showing as and introducing probabilistic arguments that have shaped subsequent work [Alon1988Linear]. The lower-order error term has since been sharpened repeatedly, recently by Christoph, Draganić, Girão, Hurley, Michel, and Müyesser [ChristophEtAl2025Linear], and the exact bound is known for many degree ranges and for numerous graph classes.
The conjecture is thus true up to lower-order terms, but the exact ceiling for every maximum degree remains unproved, and closing the gap between and the conjectured value is the outstanding task.
References (3)
- [AkiyamaExooHarary1981]
Covering and packing in graphs. III. Cyclic and acyclic invariants
Open ↗Jin Akiyama and Geoffrey Exoo and Frank Harary · 1980 · misc
- [Alon1988Linear]
The linear arboricity of graphs
Open ↗Noga Alon · 1988 · misc
- [ChristophEtAl2025Linear]
New bounds for linear arboricity and related problems
Open ↗Micha Christoph and Nemanja Draganić and António Girão and Eoin Hurley and Lukas Michel and Alp Müyesser · 2025 · misc
The boxed statement is the canonical open formulation — not a stronger variant or a related research program. The status reflects the catalog's last review; do your own literature search before investing serious effort.