For f_r(i)=r\sqrt{\log i}, let GM_{f_r} assert that every sufficiently long sequence of simple graphs G_i with |G_i|<K+f_r(i) contains i<j with G_i a minor of G_j.
Statement
For f_r(i)=r\sqrt{\log i}, let GM_{f_r} assert that every sufficiently long sequence of simple graphs G_i with |G_i|<K+f_r(i) contains i<j with G_i a minor of G_j. Conjecture: GM_{f_r} is provable in I\Delta_0+\exp for r\le2 and unprovable in PA for r>2.
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.