Nash-Williams' edge-connectivity orientation conjecture
Statement
For a natural number , a graph is -edge-connected if every edge cut has size at least , and an orientation is -arc-connected if every ordered pair of vertices is joined by at least edge-disjoint directed paths. Nash-Williams' edge-connectivity orientation conjecture. For any natural number , every -edge-connected graph admits a -arc-connected orientation. This is the edge-connectivity consequence of Nash-Williams' orientation problem for arbitrary graphs. The supplied status evidence says that this problem was answered by Thomas, who proved that one can take ; accordingly, this candidate is recorded as solved.
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.