ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A cubic graph is a graph in which every vertex has degree 33, and it is cyclically 44-edge-connected if at least four edges must be removed to disconnect it into components containing at least two cycles. The circumference ratio of a graph is the length of a longest cycle divided by its number of vertices. The 7/8 circumference-ratio conjecture. Every cyclically 44-edge-connected cubic graph has circumference ratio at least 7/87/8. This is proposed as a strengthening of Bondy's linear circumference conjecture. The paper constructs cyclically 44-edge-connected cubic graphs with circumference ratio 7/8+o(1)7/8+o(1), showing that the proposed bound would be tight if true.

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.