Erdős Problem #560 — Size Ramsey number of balanced complete bipartite graphs
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 . Determine where is the complete bipartite graph with vertices in each component.
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.