Erdős's exponential conjecture for induced Ramsey numbers
Statement
Let be a graph with vertices, and let denote the minimum number of vertices of a graph such that every red-blue edge-colouring of contains an induced monochromatic copy of . Erdős's conjecture. There exists a constant such that
for every graph with 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.