ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a natural number kk, a graph is 2k2k-edge-connected if every edge cut has size at least 2k2k, and an orientation is kk-arc-connected if every ordered pair of vertices is joined by at least kk edge-disjoint directed paths. Nash-Williams' edge-connectivity orientation conjecture. For any natural number kk, every 2k2k-edge-connected graph admits a kk-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 f(k)=8kf(k)=8k; 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.