Frank's vertex-connected orientation conjecture
Statement
Let be a graph and let be a positive integer. A -vertex-connected orientation is an orientation of that is -vertex-connected. Frank's conjecture. has a -vertex-connected orientation if and only if and is -edge-connected for all with .
The conjecture was proved for by Thomassen, but was disproved for every by Durand de Gevigney; deciding whether a graph has a -vertex-connected orientation is NP-hard for every .
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.