Girth Ramsey theorem (Theorem 3)
Statement
Given an integer , a graph with , and a natural number , there exists a graph with and . Here is the edge-colouring Ramsey relation described in the report: every -colouring of the edges of contains a monochromatic induced copy of .
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.