Cut covers and small cases of Mader's local-connectivity conjecture
Statement
Conjecture 6. 2 2. (Mader) If a digraph D has δ+
D
≥ r, then there are vertices x 6 = y such that
λ(x, y ) ≥ r. Also, there is an edge (x, y ) so that λ(x, y ) ≥ r.
The first part of this conjecture was proven by Mader [24] for λ(x, y ) ≥ r − 1.
#6.6 Weighted Versions
Record
- Source
- Added
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.