The conjecture that every 3-edge-connected graph has Frank number at most 3
Statement
Let be a -edge-connected graph. Its Frank number is the minimum number of orientations needed so that every edge is deletable in at least one of them. Frank-number conjecture. Every -edge-connected graph satisfies
The paper proves the general upper bound , obtains for the Petersen graph, and gives improved bounds for more restricted graph classes. Improving the general bound to remains open.
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.