Linear Arboricity Conjecture Insights

• Linear Arboricity Conjecture is a graph theory problem that defines the minimum number of linear forests required to cover a graph’s edges, typically between ⌈Δ/2⌉ and ⌈(Δ+1)/2⌉.
• It connects edge-coloring and forest decompositions, using techniques like the nibble method, Hamiltonian rotations, and probabilistic analysis for establishing asymptotic bounds.
• Recent advances include logarithmic-error bounds, constructive results for degenerate and dense graphs, and extensions to list variants and directed analogues.

Searching arXiv for recent and foundational papers on the Linear Arboricity Conjecture. arxiv_search(query="Linear Arboricity Conjecture", max_results=10, sort_by="relevance") arxiv_search({"query":"Linear Arboricity Conjecture","max_results":10,"sort_by":"relevance"}) I’ll look up relevant arXiv papers on the Linear Arboricity Conjecture and related list/directed variants. <tool name="arxiv_search"> {"query":"Linear Arboricity Conjecture","max_results":10,"sort_by":"relevance"} </tool> The Linear Arboricity Conjecture concerns decompositions of graphs into path-forests. A linear forest is a forest whose connected components are paths, and the linear arboricity of a graph $G$, denoted $\operatorname{la}(G)$, is the minimum number of linear forests whose edge sets partition $E(G)$. Introduced by Akiyama, Exoo, and Harary, the conjecture asserts that every graph of maximum degree $\Delta$ satisfies

$$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$

The problem sits at the intersection of edge-coloring, sparse decomposition, and Hamiltonian methods, and has developed into a broader theory including list versions, directed analogues, dense-graph confirmations, random-graph confirmations, and recent logarithmic-error bounds for general graphs (Kim et al., 2017, Christoph et al., 28 Jul 2025, Shi et al., 23 Dec 2025).

1. Definitions, lower bounds, and equivalent forms

A linear forest is equivalently a graph of maximum degree at most $2$ with no cycles. In some parts of the literature the linear arboricity is denoted $\chi'_l(G)$, but the notation $\operatorname{la}(G)$ is now standard. A linear coloring of $G$ is an edge-coloring in which each color class induces a linear forest; then $\operatorname{la}(G)$ is the minimum number of colors in such a coloring (Basavaraju et al., 2020).

The basic lower bound is immediate. If $\operatorname{la}(G)$0 is a vertex of degree $\operatorname{la}(G)$1, then each linear forest contributes at most two edges incident to $\operatorname{la}(G)$2, so

$\operatorname{la}(G)$3

For regular graphs there is a stronger obstruction. Harary observed that for $\operatorname{la}(G)$4-regular graphs one has

$\operatorname{la}(G)$5

and because every graph is a subgraph of a $\operatorname{la}(G)$6-regular graph, settling the conjecture for regular graphs suffices. In particular, the usual “regular form” of the conjecture is that every $\operatorname{la}(G)$7-regular graph satisfies

$\operatorname{la}(G)$8

This is equivalent to the maximum-degree formulation (Basavaraju et al., 2020, Kim et al., 2017).

A common misunderstanding is to treat the conjecture as a universal $\operatorname{la}(G)$9 statement. The standard formulation is $E(G)$0, and the distinction matters when $E(G)$1 is even. The parity obstruction is explicit in regular graphs: if $E(G)$2 is even and one tried to decompose a $E(G)$3-regular graph into $E(G)$4 linear forests, then every vertex would have degree exactly $E(G)$5 in every color class, forcing each class to be $E(G)$6-regular and hence a union of cycles rather than a forest (Kim et al., 2017).

The conjecture is tight in natural classes. Complete graphs satisfy $E(G)$7, which equals $E(G)$8 since $E(G)$9 (Gao et al., 2024). More generally, when $\Delta$0 is odd, the lower bound $\Delta$1 and the conjectured upper bound $\Delta$2 coincide; when $\Delta$3 is even, the exact value may be either $\Delta$4 or $\Delta$5, and deciding which occurs is NP-complete in general (Gao et al., 2024).

2. Classical statement and historical context

The conjecture emerged as a degree-$\Delta$6 analogue of edge-coloring and arboricity problems. Whereas matchings correspond to color classes of maximum degree $\Delta$7, linear forests allow degree $\Delta$8 but forbid cycles, so the conjecture interpolates between edge-coloring and acyclic decompositions. This perspective is explicit in later surveys and extensions, including the list version and degree-$\Delta$9 generalizations (Kim et al., 2017, Wdowinski, 2023).

The early literature established the conjecture in several exact cases. It is known for graphs with $$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$0 and for $$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$1, and exact results were also obtained for complete graphs, complete bipartite graphs, series-parallel graphs, and planar graphs (Kim et al., 2017, Chen et al., 2022). These exact confirmations showed that the conjectured bound is not merely asymptotically plausible but structurally sharp in a wide range of families.

The conjecture has also generated stronger local versions. One such strengthening is the List Linear Arboricity Conjecture, due to An and Wu, which asserts that the list analogue satisfies

$$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$2

Another line extends the problem to digraphs, where the components are directed paths rather than undirected paths (Kim et al., 2017, Shi et al., 23 Dec 2025).

3. Quantitative progress for general graphs

For unrestricted graphs, progress was long measured by how close one could get to $$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$3. The asymptotic program began with Alon’s proof that

$$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$4

followed by Alon–Spencer’s improvement to

$$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$5

and Ferber–Fox–Jain’s further reduction to $$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$6 for some $$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$7 (Lang et al., 2020, Ferber et al., 2018).

Regime	Bound for $$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$8	Source
Asymptotic general bound	$$\left\lceil \frac{\Delta}{2}\right\rceil \le \operatorname{la}(G) \le \left\lceil \frac{\Delta+1}{2}\right\rceil.$$9	(Lang et al., 2020)
Improved asymptotic bound	$2$0	(Lang et al., 2020)
Polynomial improvement	$2$1	(Ferber et al., 2018)
Nibble/list-era bound	$2$2	(Lang et al., 2020)
Logarithmic-error bound	$2$3	(Christoph et al., 28 Jul 2025)

A major step came from the modified nibble framework of Lang and Postle, which gave

$2$4

for sufficiently large $2$5, and did so in the stronger list setting. The proof duplicated each color into “twin colors,” reduced the problem to a proper edge-coloring problem in product lists, and then prevented twin-alternating cycles so that each original color class became an acyclic degree-$2$6 subgraph, hence a linear forest (Lang et al., 2020).

A further development in 2025 broke the square-root barrier. The bound

$2$7

was proved for every $2$8-vertex graph of maximum degree $2$9, where “$\chi'_l(G)$0” denotes $\chi'_l(G)$1 with an absolute constant. The same work proved

$\chi'_l(G)$2

for fractional linear arboricity. The method generalized Pósa rotations from single endpoints of a path to simultaneous rotations of multiple endpoints of a linear forest, and when $\chi'_l(G)$3 it gives an exponential improvement over the previous best error term on the log-scale (Christoph et al., 28 Jul 2025).

These quantitative results collectively reposition the conjecture. The obstruction is no longer merely asymptotic validity: for general graphs, the gap is now logarithmic in $\chi'_l(G)$4 rather than polynomial in $\chi'_l(G)$5.

4. Exact and near-exact results in structured graph classes

A large body of exact work concerns sparse classes described by degeneracy. A graph is $\chi'_l(G)$6-degenerate if every subgraph has a vertex of degree at most $\chi'_l(G)$7. Chen, Hao, and Yu proved that every $\chi'_l(G)$8-degenerate graph $\chi'_l(G)$9 satisfies

$\operatorname{la}(G)$0

and hence satisfies the conjectured upper bound already when $\operatorname{la}(G)$1 (Chen et al., 2022). This result is constructive and shows that on sufficiently high-degree degenerate graphs the trivial lower bound is attained exactly.

Subsequent work sharpened the low-degeneracy thresholds. For $\operatorname{la}(G)$2-degenerate graphs,

$\operatorname{la}(G)$3

improving the earlier threshold $\operatorname{la}(G)$4. The same paper gave a different proof of the Linear Arboricity Conjecture for all $\operatorname{la}(G)$5-degenerate graphs and proved that every $\operatorname{la}(G)$6-degenerate graph satisfies

$\operatorname{la}(G)$7

These results came with linear-time algorithms and detailed control over monochromatic vertices (Basavaraju et al., 2020).

Dense graphs admit a different exact regime. For every fixed $\operatorname{la}(G)$8, there exists $\operatorname{la}(G)$9 such that if $G$0 has $G$1 vertices and minimum degree

$G$2

then

$G$3

The proof regularizes the graph by path removals, uses robust expansion and Hamilton-decomposition theorems, and then converts Hamilton cycles into path decompositions by breaking them at auxiliary vertices (Gao et al., 2024).

Random graphs satisfy an even stronger statement in a sparse regime. If $G$4 is sufficiently large and

$G$5

then with high probability

$G$6

Thus, in this range the random graph attains the optimum lower bound with high probability, which is “even slightly less than in the linear arboricity conjecture” when $G$7 is even (Draganić et al., 2023).

Large girth provides another structured route. For a $G$8-regular graph $G$9 with girth $\operatorname{la}(G)$0, one has

$\operatorname{la}(G)$1

which is exactly the conjectured value for $\operatorname{la}(G)$2. More generally, the same work proved girth-indexed bounds such as $\operatorname{la}(G)$3 when $\operatorname{la}(G)$4 and $\operatorname{la}(G)$5 when $\operatorname{la}(G)$6, using a 2-factor decomposition and an auxiliary flow network with lower bound constraints to find a sparse cycle-transversal subgraph (Mishra, 12 Dec 2025).

5. List linear arboricity

The list version replaces a common palette by edge-specific permissible sets. A list assignment $\operatorname{la}(G)$7 gives each edge $\operatorname{la}(G)$8 a set $\operatorname{la}(G)$9 of colors, and a linear $\operatorname{la}(G)$00-coloring is a map $\operatorname{la}(G)$01 with $\operatorname{la}(G)$02 such that each color class induces a linear forest. The list linear arboricity $\operatorname{la}(G)$03 is the minimum $\operatorname{la}(G)$04 such that every list assignment with $\operatorname{la}(G)$05 for all edges admits a linear $\operatorname{la}(G)$06-coloring. Clearly,

$\operatorname{la}(G)$07

(Kim et al., 2017, Shi et al., 23 Dec 2025).

An and Wu’s conjectural strengthening states that the list parameter should equal the ordinary one: $\operatorname{la}(G)$08 Kim and Postle proved this asymptotically: for every $\operatorname{la}(G)$09 and sufficiently large $\operatorname{la}(G)$10,

$\operatorname{la}(G)$11

and more strongly, in a color-degree formulation, if $\operatorname{la}(G)$12 and $\operatorname{la}(G)$13, then $\operatorname{la}(G)$14 admits a linear $\operatorname{la}(G)$15-coloring (Kim et al., 2017).

The strongest quantitative list bound in the data is

$\operatorname{la}(G)$16

for sufficiently large $\operatorname{la}(G)$17. This bound was obtained by tying linear arboricity to the List Colouring Conjecture through color duplication: each original color $\operatorname{la}(G)$18 is replaced by twins $\operatorname{la}(G)$19 and $\operatorname{la}(G)$20, one constructs a proper edge-coloring from the product lists, and then forbids twin-alternating cycles. Properness at the twin level gives maximum per-color degree at most $\operatorname{la}(G)$21, while the cycle condition forces acyclicity of each original color class (Lang et al., 2020).

This list framework is not merely technical strengthening. It is the setting in which the best undirected asymptotic bound was first proved, and it became the template for later directed extensions (Shi et al., 23 Dec 2025).

6. Directed analogues and related generalizations

For a digraph $\operatorname{la}(G)$22, a directed linear forest is a disjoint union of directed paths, and $\operatorname{la}(G)$23 is the minimum number of directed linear forests needed to partition $\operatorname{la}(G)$24. The degree parameter is

$\operatorname{la}(G)$25

where $\operatorname{la}(G)$26 and $\operatorname{la}(G)$27 are the maximum out-degree and in-degree. Nakayama and Péroche conjectured that every digraph satisfies

$\operatorname{la}(G)$28

(Shi et al., 23 Dec 2025).

The directed problem has a sharper small-exception structure than the undirected one. For a $\operatorname{la}(G)$29-regular digraph, every directed forest has at most $\operatorname{la}(G)$30 arcs, so

$\operatorname{la}(G)$31

Nakayama–Péroche’s conjecture is therefore equivalent to $\operatorname{la}(G)$32 for all $\operatorname{la}(G)$33-regular digraphs. However, He et al. found counterexamples: the symmetric complete digraphs $\operatorname{la}(G)$34 and $\operatorname{la}(G)$35 satisfy $\operatorname{la}(G)$36 and $\operatorname{la}(G)$37 (Shi et al., 23 Dec 2025).

The strongest directed/list asymptotic result in the data is the theorem

$\operatorname{la}(G)$38

for sufficiently large $\operatorname{la}(G)$39. It extends the Lang–Postle undirected bound to digraphs with a matching asymptotic error term, and it works in the stronger list setting. The proof adapts the semi-random Rödl nibble to enforce a partial $\operatorname{la}(G)$40-edge-coloring, introduces suspicious directed paths to prevent monochromatic directed cycles, and combines the Lovász Local Lemma, Talagrand’s inequality, and reserve-color arguments in the style of Molloy–Reed. As an immediate consequence, any Eulerian orientation of a $\operatorname{la}(G)$41-regular graph admits a decomposition into at most

$\operatorname{la}(G)$42

directed linear forests (Shi et al., 23 Dec 2025).

The conjecture has also been placed inside broader degree-constrained coloring theories. One direction studies degree-$\operatorname{la}(G)$43 arboricity and its directed branching analogue. In that setting, Truszczyński’s conjecture was disproved for general multigraphs, but positive large-girth and asymptotic results were proved for simple graphs and digraphs. For bounded $\operatorname{la}(G)$44, this framework still yields asymptotic confirmations of the linear arboricity conjecture in the case $\operatorname{la}(G)$45 (Wdowinski, 2023). Another orientation-based approach proved that the Linear Arboricity Conjecture holds for all $\operatorname{la}(G)$46-degenerate loopless multigraphs when

$\operatorname{la}(G)$47

improving a previously announced quadratic threshold for simple graphs and extending the conclusion to multigraphs (Wdowinski, 2021).

7. Methods, significance, and open problems

Three methodological strands dominate the modern theory. The first is probabilistic and local: nibble arguments, concentration inequalities, and the Lovász Local Lemma. This line underlies the best list and directed asymptotic bounds, where the main difficulty is to control both degree constraints and monochromatic cycles while lists evolve under random deletions (Lang et al., 2020, Shi et al., 23 Dec 2025). The second is Hamiltonian and global: robust expansion, Hamilton decompositions, and path-removal regularization, which have proved decisive in dense graphs and random graphs (Gao et al., 2024, Draganić et al., 2023). The third is structural and combinatorial: generalized Pósa rotations, flow transversals, and pivot-based recoloring schemes, which drive the 2025 logarithmic-error bound, the girth-based results, and the low-degeneracy exact theorems (Christoph et al., 28 Jul 2025, Mishra, 12 Dec 2025, Basavaraju et al., 2020).

Algorithmic status is mixed. Some sparse-class results are fully constructive and even linear-time, notably for $\operatorname{la}(G)$48- and $\operatorname{la}(G)$49-degenerate graphs (Basavaraju et al., 2020). The dense minimum-degree theorem yields a polynomial-time algorithm, though with very large hidden constants from the regularity and expansion machinery (Gao et al., 2024). By contrast, the $\operatorname{la}(G)$50 general bound is explicitly non-constructive: the rotation-component analysis and the distribution on minimum linear forests are not currently accompanied by a polynomial-time implementation (Christoph et al., 28 Jul 2025).

Several open problems remain central. The primary one is the conjecture itself for arbitrary graphs. On the quantitative side, the directed/list work highlights the challenge of removing polylogarithmic factors and pushing the error term from $\operatorname{la}(G)$51 or $\operatorname{la}(G)$52 toward $\operatorname{la}(G)$53, and ultimately toward the exact conjectured constants (Shi et al., 23 Dec 2025). In sparse classes, the exact threshold for $\operatorname{la}(G)$54-degenerate graphs is unresolved: the quadratic threshold $\operatorname{la}(G)$55 is unlikely to be optimal, and reducing it to a linear function of $\operatorname{la}(G)$56, ideally $\operatorname{la}(G)$57, is explicitly posed as a natural direction (Chen et al., 2022, Basavaraju et al., 2020). For dense graphs, it remains open whether the exact bound can be proved under the bare Dirac threshold $\operatorname{la}(G)$58 rather than $\operatorname{la}(G)$59 (Gao et al., 2024). In the directed setting, the gap between the asymptotic list bound and the conjectural $\operatorname{la}(G)$60 bound remains substantial, especially outside the known small symmetric complete exceptions (Shi et al., 23 Dec 2025).

Taken together, these developments show that the Linear Arboricity Conjecture is no longer only a classical extremal statement. It has become a focal point for interactions among edge-coloring, list-coloring, degeneracy theory, Hamilton decomposition, probabilistic methods, and directed graph decomposition. The exact conjecture remains open, but the current landscape is markedly sharper: logarithmic-error bounds are known in full generality, exact confirmations are known in dense, random, and several sparse regimes, and the list and directed theories now mirror much of the undirected asymptotic structure (Christoph et al., 28 Jul 2025, Draganić et al., 2023, Shi et al., 23 Dec 2025).