ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KnK_n be the complete graph on nn vertices. The online size Ramsey number r~(Kn,Kn)\tilde{r}(K_n,K_n) is the least number of rounds needed for Builder to force a red or blue copy of KnK_n, while the size Ramsey number r^(Kn,Kn)\hat{r}(K_n,K_n) is the least number of edges in a graph whose every red-blue edge-colouring contains a red or blue copy of KnK_n.

Kurek–Ruciński conjecture.

r~(Kn,Kn)r^(Kn,Kn)→0 for n→∞.\frac{\tilde{r}(K_n,K_n)}{\hat{r}(K_n,K_n)}\to 0\text{ for } n\to\infty.

This conjecture asks whether the adaptive online version is asymptotically negligible compared with the classical size Ramsey number. The source describes it as still open.

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.