ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Rvm(k)R_{\mathrm{vm}}(k) denote the smallest integer nn such that every graph on nn vertices contains the edgeless graph EkE_k as a vertex-minor. The known values for k=2,3,4k=2,3,4 are 33, 77, and 1111, respectively, and the next unresolved case concerns k=5k=5.

Vertex-minor Ramsey number conjecture for k=5k=5.

Rvm(5)=15.R_{\mathrm{vm}}(5)=15.

This is the next unresolved case in the study of vertex-minor Ramsey numbers. It extends the observed pattern Rvm(k)=4k−5R_{\mathrm{vm}}(k)=4k-5 for k=2,3,4k=2,3,4, while the general bounds allow substantially larger values.

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.