Polynomial vertex-deletion sensitivity conjecture for Ramsey numbers
Statement
For an -vertex graph and a vertex , write for the graph obtained by deleting , and define
Polynomial sensitivity conjecture. There is some such that for all sufficiently large .
The preceding bounds give , so the conjecture asks for a polynomial lower bound on the effect of deleting one vertex.
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.