ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Rpiv(k)R_{\mathrm{piv}}(k) be the minimum nn such that every nn-vertex graph contains an independent set or clique of size kk as a pivot-minor. Pivot-minor Ramsey conjecture.

Rpiv(k)≤poly(k).R_{\mathrm{piv}}(k) \leq \mathsf{poly}(k).

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 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.