Akiyama–Exoo–Harary Linear Arboricity Conjecture
Statement
A linear forest is a graph whose connected components are paths, and the linear arboricity of a graph is the minimum number of linear forests whose edge sets partition . Let be any graph with maximum degree .
Linear Arboricity Conjecture.
The conjecture is known for several classes, including trees, complete graphs, and complete bipartite graphs, and it holds asymptotically for large maximum degree. The exact assertion remains open for general graphs.
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.