ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 33-edge-connected graph. Its Frank number f(G)f(G) is the minimum number of orientations needed so that every edge is deletable in at least one of them. Frank-number conjecture. Every 33-edge-connected graph GG satisfies

f(G)≤3.f(G)\leq 3.

The paper proves the general upper bound f(G)≤7f(G)\leq 7, obtains f(G)=3f(G)=3 for the Petersen graph, and gives improved bounds for more restricted graph classes. Improving the general bound to 33 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 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.