ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, let G⃗\vec{G} be an orientation of GG, and let tac(G⃗)tac(\vec{G}) denote its total arc-connectivity. An orientation maximizes total arc-connectivity when it maximizes tac(G⃗)tac(\vec{G}) among all orientations of GG. Well-balanced orientation conjecture. Every graph GG has an orientation G⃗\vec{G} that maximizes tac(G⃗)tac(\vec{G}) and is well-balanced. The source presents this as a stronger statement than the conjecture about 2-edge-connected graphs and does not give a resolution.

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.