Kurek–Ruciński conjecture on the online-to-size Ramsey ratio for cliques
Statement
Let be the complete graph on vertices. The online size Ramsey number is the least number of rounds needed for Builder to force a red or blue copy of , while the size Ramsey number is the least number of edges in a graph whose every red-blue edge-colouring contains a red or blue copy of .
Kurek–Ruciński conjecture.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.