Rödl–Szemerédi conjecture on superlinear size-Ramsey numbers
Statement
Let . A sequence of graphs is said to have maximum degree at most when every has vertices and maximum degree at most . The size-Ramsey number is the minimum number of edges in a graph whose every edge-colouring contains a monochromatic copy of .
Rödl–Szemerédi conjecture. For every there exist and a sequence of graphs on vertices and maximum degree at most such that
This conjecture asks whether bounded-degree graphs can have size-Ramsey numbers that are genuinely superlinear in their order. The paper identifies it as a central open question in the area; the conjecture is attributed to Rödl and Szemerédi.
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.