Quadratic additive bound conjecture for sparse spanning strongly connected subgraphs of tournaments
Statement
Let be a positive integer, and let be a strongly -connected tournament on vertices. A strongly -connected spanning subgraph is a spanning subgraph with strong vertex-connectivity at least . Quadratic additive bound conjecture. There is a constant such that contains a strongly -connected spanning subgraph with at most
arcs. The paper proves an upper bound of arcs and states that reducing the additive term to 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.