Liu and Ning's interpolation conjecture for 2-connected subgraphs
Statement
For a fixed integer , let be an integer threshold. Let be a 2-connected graph of order , and write for its minimum degree. Liu and Ning's conjecture. Every such graph satisfying
contains a -connected subgraph of order for every . This conjecture seeks an asymptotic minimum-degree threshold guaranteeing 2-connected subgraphs of every possible order; the preceding results establish stronger degree thresholds, namely approximately and , but the proposed threshold for every fixed remains unresolved.
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.