Strong orientation conjecture for maximum total arc-connectivity
Statement
Let be a 2-edge-connected 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 . An orientation is strong when the resulting digraph is strongly connected. Strong orientation conjecture. Every 2-edge-connected graph has an orientation that maximizes and is strong. The conjecture asks whether maximum total arc-connectivity can always be attained by a strongly connected orientation; the source calls it plausible and gives no 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.