ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a graph with kk vertices, and let Rind(H)R^{\mathrm{ind}}(H) denote the minimum number of vertices of a graph GG such that every red-blue edge-colouring of GG contains an induced monochromatic copy of HH. Erdős's conjecture. There exists a constant C>0C>0 such that

Rind(H)⩽2CkR^{\mathrm{ind}}(H)\leqslant 2^{Ck}

for every graph HH with kk vertices. This conjecture predicts an exponential upper bound for induced Ramsey numbers; it was recently proved by Aragão, Campos, Dahia, Filipe and Marciano.

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.