Conlon–Fox–Sudakov vertex-deletion conjecture for Ramsey numbers
Statement
Let denote the two-color Ramsey number of a graph . Let be a graph, and let be obtained from by deleting a single vertex. Conlon–Fox–Sudakov conjecture. There exists a universal constant such that
The paper disproves this conjecture by constructing graphs for which vertex deletion can reduce the Ramsey number by a super-constant factor.
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.