ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a cyclically 44-edge-connected graph, meaning that deleting fewer than 44 edges cannot separate GG into two components both containing a cycle. Let fn(G)fn(G) denote its Frank number. Frank number conjecture for cyclically 4-edge-connected graphs. The Petersen graph is the only cyclically 44-edge-connected graph with

fn(G)>2.fn(G)>2.

Equivalently, every cyclically 44-edge-connected graph other than the Petersen graph should have Frank number at most 22. The paper reduces this conjecture to the cubic case; cubic graphs have Frank number at least 22 because they cannot be 44-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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.