Well-balanced orientation conjecture for maximum total arc-connectivity
Statement
Let be a graph, let be an orientation of , and let denote its total arc-connectivity. An orientation maximizes total arc-connectivity when it maximizes among all orientations of . Well-balanced orientation conjecture. Every graph has an orientation that maximizes 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.