ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, a linear forest is a forest whose components are paths, and the linear arboricity la(G)la(G) is the minimum number of disjoint linear forests whose union contains all edges of GG. Let Δ\Delta be the maximum degree of GG.

Akiyama's linear arboricity conjecture. For every graph GG of maximum degree Δ\Delta,

la(G)≤⌈Δ+12⌉.la(G)\leq \left\lceil\frac{\Delta+1}{2}\right\rceil.

The conjecture was raised by Akiyama and collaborators and is presented in the paper as a central related problem. The supplied text gives no resolution status.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.