Sparse strongly connected spanning subgraph conjecture with optimal degree-dependent bound
Statement
Let and . Sparse spanning subgraph conjecture. There is such that every strongly -connected -vertex digraph with contains a strongly -connected spanning subgraph with at most
edges. There is also such that every strongly -arc-connected -vertex directed multigraph with contains a strongly -arc-connected spanning subgraph with at most
edges. The conjecture refines the paper's upper bound and is best possible in its 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.