Asymptotic minimum-degree interpolation conjecture for 2-connected subgraphs
Statement
Let be a 2-connected graph of order , and let denote its minimum degree.
Asymptotic interpolation conjecture. If and
then there exists an integer such that, whenever , has a -connected subgraph of order for each .
This is proposed as a weaker alternative to Yin and Wu's minimum-degree conjecture. The paper motivates it by noting that the authors suspect the stronger conjecture is false for infinitely many values of ; whether this asymptotic statement holds remains open in the supplied text.
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.