ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A graph is well-balanced oriented when it has an orientation in which, for every pair of vertices, the maximum number of edge-disjoint directed paths from the first vertex to the second equals the maximum number in the reverse direction. Nash-Williams' well-balanced orientation conjecture. Every graph admits a well-balanced orientation. This is one of the two general statements attributed to Nash-Williams that were historically left unproved; the supplied status evidence indicates that the associated orientation problem has since been resolved.

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.