ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be an oriented planar graph, meaning a planar digraph without directed cycles of length at most 22. A 22-colouring of DD is a function f:V(D)→{1,2}f:V(D)\to\{1,2\} such that the subdigraph induced by the vertices of each colour is acyclic. Neumann–Lara's conjecture. Every oriented planar graph is 22-colourable. The conjecture was proposed by Neumann–Lara in 1985 and independently by Škrekovski. The paper proves the relaxed version for planar digraphs of digirth at least four, while the case of digirth at least three remains open.

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.