ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The cochromatic number of GG, denoted by ζ(G)\zeta(G), is the minimum number of colours needed to colour the vertices of GG such that each colour class induces either a complete graph or empty graph. The dichromatic number of GG, denoted by δ(G)\delta(G), is the minimum number kk of colours required such that, in any orientation of the edges of GG, there is a kk-colouring of the vertices of GG such that there are no monochromatic oriented cycles. Must a graph with large chromatic number have large dichromatic number? Must a graph with large cochromatic number contain a graph with large dichromatic number?

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.