Erdős Problem #561
Statement
Let denote the size Ramsey number, the minimal number of edges such that there is a graph with edges such that in any -colouring of the edges of there is a monochromatic copy of . Let and be the union of stars. More precisely, let and . Prove that
Record
- Source
- Added
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.