ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let R^(G)\hat{R}(G) denote the size Ramsey number, the minimal number of edges mm such that there is a graph HH with mm edges such that in any 22-colouring of the edges of HH there is a monochromatic copy of GG. Determine R^(Kn,n),\hat{R}(K_{n,n}), where Kn,nK_{n,n} is the complete bipartite graph with nn 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.