ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 2-connected graph of order nn, and let δ(G)\delta(G) denote its minimum degree.

Asymptotic interpolation conjecture. If k⩾3k\geqslant3 and

δ(G)⩾nk,\delta(G)\geqslant\frac{n}{k},

then there exists an integer n0=f(k)n_0=f(k) such that, whenever n⩾n0n\geqslant n_0, GG has a 22-connected subgraph of order ℓ\ell for each ℓ∈{4,…,n}\ell\in\{4,\ldots,n\}.

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 nn; 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 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.