The local linear arboricity conjecture
Statement
Let be a simple graph with maximum degree , and let denote its local linear arboricity: the minimum number such that is covered by linear forests and every vertex belongs to at most of them.
Local linear arboricity conjecture. The value is either
or
This statement is necessary for the linear arboricity conjecture because local linear arboricity is at most ordinary linear arboricity. Its resolution status is not specified in the source.
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.