ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let k,n≥1k,n\geq 1 and Δ‾≥0\overline{\Delta}\geq 0. Sparse spanning subgraph conjecture. There is C>0C>0 such that every strongly kk-connected nn-vertex digraph DD with Δ‾(D)≤Δ‾\overline{\Delta}(D)\leq\overline{\Delta} contains a strongly kk-connected spanning subgraph with at most

kn+kΔ‾+Ck2kn+k\overline{\Delta}+Ck^2

edges. There is also C′>0C'>0 such that every strongly kk-arc-connected nn-vertex directed multigraph DD with Δ‾(D)≤Δ‾\overline{\Delta}(D)\leq\overline{\Delta} contains a strongly kk-arc-connected spanning subgraph with at most

kn+kΔ‾+C′k2kn+k\overline{\Delta}+C'k^2

edges. The conjecture refines the paper's upper bound and is best possible in its kΔ‾k\overline{\Delta} term according to the construction discussed immediately before it; the source does not report a resolution.

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.