The vertex-minor Ramsey number conjecture for five vertices
Statement
Let denote the smallest integer such that every graph on vertices contains the edgeless graph as a vertex-minor. The known values for are , , and , respectively, and the next unresolved case concerns .
Vertex-minor Ramsey number conjecture for .
This is the next unresolved case in the study of vertex-minor Ramsey numbers. It extends the observed pattern for , 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.