ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An oriented digraph is a digraph whose underlying undirected graph is simple, and a digraph is kk-colourable if its vertices admit a colouring with kk colours such that every colour class is acyclic.

Two-Colour-Conjecture. Every oriented planar digraph DD is 22-colourable.

This is the directed analogue of the Four-Colour Theorem. The conjecture was posed by Erdős and Neumann-Lara, and independently by Skrekovski, and 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.