Polynomial pivot-minor Ramsey number conjecture
Statement
Let be the minimum such that every -vertex graph contains an independent set or clique of size as a pivot-minor. Pivot-minor Ramsey conjecture.
This conjecture would imply the polynomial bound for the vertex-minor Ramsey number. It holds when the graphs are restricted to any proper pivot-minor closed class, but remains open for arbitrary graphs.
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.