ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a planar graph with maximum degree 44. Its linear arboricity la(G){\rm la}(G) is the minimum number of linear forests whose union is the edge set of GG.

Planar degree-four linear arboricity complexity conjecture. It is NP-complete to determine whether

la(G)=2.{\rm la}(G)=2.

The paper identifies this as the only remaining case in its discussion of planar graphs: the cases of odd maximum degree are immediate, maximum degree at least 99 are settled by the main theorem, and the planar linear arboricity conjecture would settle maximum degrees 66 and 88.

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.