Erdős Problem #625 — Chromatic versus cochromatic number of random graphs
Statement
The cochromatic number of , denoted by , is the minimum number of colours needed to colour the vertices of such that each colour class induces either a complete graph or empty graph. Let denote the chromatic number. If is a random graph with vertices and each edge included independently with probability then is it true that almost surely as ?
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.