ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a fixed integer q≥3q\ge 3, let n0(q)n_0(q) be an integer threshold. Let GG be a 2-connected graph of order n≥n0(q)n\ge n_0(q), and write δ(G)\delta(G) for its minimum degree. Liu and Ning's conjecture. Every such graph satisfying

δ(G)≥nq\delta(G)\ge \frac{n}{q}

contains a 22-connected subgraph of order ℓ\ell for every ℓ∈{4,5,…,n}\ell\in\{4,5,\ldots,n\}. 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 n/3n/3 and n/4n/4, but the proposed n/qn/q threshold for every fixed q≥3q\ge 3 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 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.