Frank number conjecture for cyclically 4-edge-connected graphs
Statement
Let be a cyclically -edge-connected graph, meaning that deleting fewer than edges cannot separate into two components both containing a cycle. Let denote its Frank number. Frank number conjecture for cyclically 4-edge-connected graphs. The Petersen graph is the only cyclically -edge-connected graph with
Equivalently, every cyclically -edge-connected graph other than the Petersen graph should have Frank number at most . The paper reduces this conjecture to the cubic case; cubic graphs have Frank number at least because they cannot be -edge-connected.
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.