ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A linear forest is a graph whose connected components are paths, and the linear arboricity la(G)la(G) of a graph GG is the minimum number of linear forests whose edge sets partition E(G)E(G). Let GG be any graph with maximum degree DeltaDelta.

Linear Arboricity Conjecture.

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

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 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.