Strong spanning subdigraphs in highly arc-strong and arc-antistrong digraphs
Strong spanning subdigraphs in highly arc-strong and arc-antistrong digraphs
Let be a digraph. It is -arc-strong when deleting fewer than arcs leaves a strongly connected digraph, and -arc-antistrong when deleting fewer than arcs leaves an antistrong digraph.
Special-case conjecture. There exists a natural number such that every digraph which is both -arc-strong and -arc-antistrong has arc-disjoint strong spanning subdigraphs .
This is proposed as a potentially easier special case of the preceding connectivity conjecture. The supplied text gives no resolution, so its status is open.
Sources & referencesView supporting material
Primary source
Jorgen Bang-Jensen, Stephane Bessy, Bill Jackson and Matthias Kriesell, “Antistrong digraphs”, arXiv:1605.07832 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.