Generalized asymmetric three-colour Ramsey conjecture
Statement
Let and be integers with . For graphs and positive integers , write if every -colouring of the edges of contains a monochromatic copy of in some colour ; write otherwise.
Generalized asymmetric three-colour Ramsey conjecture. For any integers , there exists a graph such that , but .
This conjecture is presented as a three-colour analogue related to the preceding conjecture in the same way that the preceding two-colour theorem relates to the Nešetřil–Rödl result. Its status is not resolved in the supplied text.
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.