Erdős Problem #136 — Five colours on every four vertices
Statement
Let be the minimum number of colours in an edge-colouring of for which every copy of receives at least five distinct colours. Is
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.