ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be a positive integer, and let TT be a strongly kk-connected tournament on nn vertices. A strongly kk-connected spanning subgraph is a spanning subgraph with strong vertex-connectivity at least kk. Quadratic additive bound conjecture. There is a constant C>0C>0 such that TT contains a strongly kk-connected spanning subgraph DD with at most

kn+Ck2kn+Ck^2

arcs. The paper proves an upper bound of kn+750k2log⁡2(k+1)kn+750k^2\log_2(k+1) arcs and states that reducing the additive term to O(k2)O(k^2) is conjectured; the supplied text gives no resolution of this conjecture.

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.