Erdős Problem #554 — Odd-cycle Ramsey numbers versus triangles
Statement
Let denote the minimal such that if the edges of are -coloured then there is a monochromatic copy of . Show that for any .
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.