ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥3d\geq 3. A sequence of graphs (Gn)(G_n) is said to have maximum degree at most dd when every GnG_n has nn vertices and maximum degree at most dd. The size-Ramsey number r^(Gn)\hat{r}(G_n) is the minimum number of edges in a graph whose every edge-colouring contains a monochromatic copy of GnG_n.

Rödl–Szemerédi conjecture. For every d≥3d\geq 3 there exist ε>0\varepsilon>0 and a sequence of graphs (Gn)(G_n) on nn vertices and maximum degree at most dd such that

r^(Gn)=Ω(n1+ε).\hat{r}(G_n)=\Omega(n^{1+\varepsilon}).

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 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.