Akiyama's linear arboricity conjecture
Statement
For a graph , a linear forest is a forest whose components are paths, and the linear arboricity is the minimum number of disjoint linear forests whose union contains all edges of . Let be the maximum degree of .
Akiyama's linear arboricity conjecture. For every graph of maximum degree ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.